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 A280051 #26 Jan 07 2017 14:39:44 %S A280051 0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,13,0,0,22,0,0,15,11,0,0,11,0,0, %T A280051 7,12,0,0,0,0,0,0,24,13,0,0,0,0,0,0,0,0,14,0,0,27,0,0,29,0,0,0,15,0,0, %U A280051 29,29,0,0,15,0,0,18,16,0,0,31,31,34,0,0,16 %N A280051 Let c_n(k) be the sequence defined in A278743; here we give the associated values of k0. %C A280051 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 k0. The values of b are given in A280052. %H A280051 Rémy Sigrist, <a href="/A280051/b280051.txt">Table of n, a(n) for n = 2..10000</a> %H A280051 Rémy Sigrist, <a href="/A278743/a278743.pdf">Illustration of the first terms of A278743, A280051, A280052</a> %H A280051 Rémy Sigrist, <a href="/A280051/a280051.png">Plot of A278743 vs A280051</a> %H A280051 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 A280051 Cf. A278743, A280052. %K A280051 nonn %O A280051 2,8 %A A280051 _N. J. A. Sloane_, Jan 06 2017 %E A280051 More terms from _Rémy Sigrist_, Jan 07 2017