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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255383 Compositorial mod sum-of-composites. 0
 0, 4, 12, 0, 1, 41, 0, 72, 2, 0, 48, 126, 0, 20, 0, 0, 90, 95, 115, 4, 0, 140, 161, 90, 261, 138, 208, 512, 72, 420, 51, 0, 0, 924, 899, 29, 893, 72, 840, 727, 129, 1185, 194, 732, 1080, 1612, 566, 175, 1352, 1192, 1204, 1360, 428, 957, 2170, 0, 0, 513, 2240 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = A036691(n) mod A053767(n). EXAMPLE For n = 5, a(5) = (4*6*8*9*10) mod (4+6+8+9+10) = 17280 mod 37 = 1. MATHEMATICA comp=Select[Range[2, 83], !PrimeQ[#]&]; Mod[Rest[FoldList[Times, 1, comp]], Accumulate[comp]] (* Ivan N. Ianakiev, May 22 2015 *) CROSSREFS Cf. A002808, A036691, A053767, A255217. Sequence in context: A113314 A180057 A222316 * A218858 A014458 A099733 Adjacent sequences:  A255380 A255381 A255382 * A255384 A255385 A255386 KEYWORD nonn,easy AUTHOR Walter Carlini, May 14 2015 EXTENSIONS More terms from Alois P. Heinz, May 21 2015 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 August 13 22:31 EDT 2020. Contains 336464 sequences. (Running on oeis4.)