The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A330578 a(n) is the remainder when the sum of the first n composite numbers is divided by the n-th composite number. 2
 0, 4, 2, 0, 7, 1, 7, 3, 14, 4, 12, 6, 21, 7, 24, 16, 7, 25, 5, 15, 4, 26, 14, 1, 11, 36, 22, 34, 4, 33, 17, 31, 14, 46, 28, 9, 23, 3, 38, 17, 53, 9, 25, 2, 42, 18, 59, 9, 52, 26, 44, 64, 37, 9, 57, 28, 48, 18, 69, 7, 60, 28, 82, 49, 71, 37, 2, 59, 23, 81, 44 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A053767(n) mod A002808(n). EXAMPLE a(3) = (4 + 6 + 8) mod 8 = 2. PROG (PARI) s=0; forcomposite (c=4, 96, s+=c; print1 (s%c", ")) CROSSREFS Cf. A002808, A053767, A071089 (prime variant), A330579 (positions of zeros). Sequence in context: A195388 A255324 A328819 * A245970 A197813 A200496 Adjacent sequences:  A330575 A330576 A330577 * A330579 A330580 A330581 KEYWORD nonn AUTHOR Rémy Sigrist, Dec 18 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 7 18:19 EST 2021. Contains 349585 sequences. (Running on oeis4.)