login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A280051
Let c_n(k) be the sequence defined in A278743; here we give the associated values of k0.
5
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, 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, 29, 29, 0, 0, 15, 0, 0, 18, 16, 0, 0, 31, 31, 34, 0, 0, 16
OFFSET
2,8
COMMENTS
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.
LINKS
N. J. A. Sloane, Table of n, A278743(n), k0(n), b(n) for n=2..42 (A précis of Sigrist's "Illustration" file)
CROSSREFS
Sequence in context: A282673 A327159 A373695 * A030121 A320659 A062535
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 06 2017
EXTENSIONS
More terms from Rémy Sigrist, Jan 07 2017
STATUS
approved