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 A076239 #14 Jul 23 2017 04:03:50 %S A076239 0,1,1,2,3,3,1,6,3,2,4,1,11,10,10,8,6,6,7,8,6,4,3,2,2,0,26,0,0,28,28, %T A076239 29,28,27,28,28,30,29,28,30,29,31,31,30,29,29,28,28,27,26,28,29,29,30, %U A076239 30,29,31,30,29,32,31,30,29,28,29,28,27,26,26,25,26,26,26,26,26,28,29 %N A076239 Remainder when 3rd-order composite ccc(n) = A050436(n) is divided by n. %H A076239 Michael De Vlieger, <a href="/A076239/b076239.txt">Table of n, a(n) for n = 1..10000</a> %F A076239 a(n) = ccc(n) mod n = A050436(n) mod n. %t A076239 MapIndexed[Mod[#1, First@ #2] &, #] &@ Nest[Values@ KeySelect[ MapIndexed[ First@ #2 -> #1 &, #], CompositeQ] &, Select[Range@ 183, CompositeQ], 2] (* _Michael De Vlieger_, Jul 22 2017 *) %Y A076239 Cf. A002808, A050435, A050436, A050438, A050439. %Y A076239 Cf. A065860, A076236, A076237, A076238. %K A076239 nonn %O A076239 1,4 %A A076239 _Labos Elemer_, Oct 08 2002