login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,2
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
KEYWORD
nonn,easy
AUTHOR
Walter Carlini, May 14 2015
EXTENSIONS
More terms from Alois P. Heinz, May 21 2015
STATUS
approved