



5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

From n >= 4 onward a(n) = 2. Outline of the proof by AK: As the sequence A094282 is forced to grow approximately like 2^n, it implies that the other terms in A094280 never "catch" the terms in A094282 and as the sum of the other elements on the nth row of A094280 grows just polynomially (Cf. A006003), their contribution to the row sum is soon minimal and A094282 (with A094282(n+1)/A094282(n) tending to the limit 2, as n > inf) defines solely the behavior of this sequence.


LINKS

Table of n, a(n) for n=1..102.


MATHEMATICA

a=FindSequenceFunction[Join[{5, 3, 3, 2}, Table[2, {102}]], n]; Table[a, {n, 1, 102}] (* Fred Daniel Kline, Apr 25 2022 *)


CROSSREFS

Cf. A094280, A094281, A094282, A094283.
Sequence in context: A346469 A068118 A076104 * A080134 A057435 A246728
Adjacent sequences: A094281 A094282 A094283 * A094285 A094286 A094287


KEYWORD

nonn


AUTHOR

Amarnath Murthy, Apr 27 2004


EXTENSIONS

Edited and extended by Antti Karttunen, Aug 25 2006


STATUS

approved



