|
|
|
|
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 n-th 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
|
|
|
MATHEMATICA
|
a=FindSequenceFunction[Join[{5, 3, 3, 2}, Table[2, {102}]], n]; Table[a, {n, 1, 102}] (* Fred Daniel Kline, Apr 25 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|