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 A246794 #11 Nov 04 2014 22:54:24 %S A246794 1,1,1,2,2,3,4,4,3,5,7,5,5,4,4,3,4,4,4,5,5,5,4,7,11,8,7,8,5,10,3,4,6, %T A246794 9,6,8,12,8,4,10,6,9,10,7,9,4,6,7,10,7,8,5,8,10,9,8,8,4,6,7,8,9,2,10, %U A246794 7,6,9,8,6,4,4,7,4,6 %N A246794 a(n) = A246785(A005669(n)). %C A246794 Conjecture: For every n, a(n) is positive. %C A246794 a(64) = 2 and A246795(64) = 30 hence A182134(49749629143526 - k) = k for 1 < k < 31, where 49749629143526 = A005669(64). %Y A246794 Cf. A000040, A002386, A005669, A182134, A246785, A246795. %K A246794 nonn,hard %O A246794 2,4 %A A246794 _Farideh Firoozbakht_, Oct 25 2014