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 A280052 #21 Jan 07 2017 14:24:34 %S A280052 1,2,1,2,3,1,2,1,4,1,2,3,4,2,1,2,4,4,2,1,1,2,1,4,2,2,3,1,2,1,4,2,1,3, %T A280052 6,1,2,5,4,2,1,3,6,2,1,2,4,4,2,3,3,6,2,1,1,2,1,4,2,4,3,6,2,1,5,1,2,3, %U A280052 4,2,1,3,6,2,1,5,6,1,2,3,4,2,2,3,6,2,1 %N A280052 Let c_n(k) be the sequence defined in A278743; here we give the associated values of b. %C A280052 Let c_n(k) be the sequence defined in A278743, for n >= 2. It is conjectured that there are numbers k0 and b such that c_n(k) satisfies the recurrence c_n(k + A278743(n)) = c_n(k)*n^b for k > k0. Here we give the values of b. The values of k0 are given in A280051. %H A280052 Rémy Sigrist, <a href="/A280052/b280052.txt">Table of n, a(n) for n = 2..10000</a> %H A280052 Rémy Sigrist, <a href="/A278743/a278743.pdf">Illustration of the first terms of A278743, A280051, A280052</a> %H A280052 N. J. A. Sloane, <a href="/A278743/a278743.txt">Table of n, A278743(n), k0(n), b(n) for n=2..42</a> (A précis of Sigrist's "Illustration" file) %Y A280052 Cf. A278743, A280051. %K A280052 nonn %O A280052 2,2 %A A280052 _N. J. A. Sloane_, Jan 06 2017 %E A280052 More terms from _Rémy Sigrist_, Jan 07 2017