This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A255383 #29 May 22 2015 10:33:47 %S A255383 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, %T A255383 138,208,512,72,420,51,0,0,924,899,29,893,72,840,727,129,1185,194,732, %U A255383 1080,1612,566,175,1352,1192,1204,1360,428,957,2170,0,0,513,2240 %N A255383 Compositorial mod sum-of-composites. %F A255383 a(n) = A036691(n) mod A053767(n). %e A255383 For n = 5, a(5) = (4*6*8*9*10) mod (4+6+8+9+10) = 17280 mod 37 = 1. %t A255383 comp=Select[Range[2,83],!PrimeQ[#]&];Mod[Rest[FoldList[Times,1,comp]],Accumulate[comp]] (* _Ivan N. Ianakiev_, May 22 2015 *) %Y A255383 Cf. A002808, A036691, A053767, A255217. %K A255383 nonn,easy %O A255383 1,2 %A A255383 _Walter Carlini_, May 14 2015 %E A255383 More terms from _Alois P. Heinz_, May 21 2015