OFFSET
0,1
COMMENTS
In general, let {f_n}_{n>=0} be the sequence defined by f_{n+1} = alpha*f_n + e_n, where alpha > 1, a <= e_n <= b, then f_n = (f_0 + e_0/alpha + ... + e_{n-1}/alpha^n)*alpha^n = c*alpha^n - (e_n/alpha + e_{n+1}/alpha^2 + ...), where c = f_0 + Sum_{n>=0} e_n/alpha^{n+1}. We conclude that c*alpha^n - b/(alpha - 1) <= f_n <= c*alpha^n - a/(alpha - 1).
Here alpha = 4/3, a = -1/3, and b = 1/3, so we conclude that c*(4/3)^n - 1 < a(n) = f_n < c*(4/3)^n + 1 for some constant c, since we have neither e_n = -1/3 for all sufficiently large n nor e_n = 1/3 for all sufficiently large n.
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..5000
FORMULA
a(n) = A087192(n+1) + 1. - Jianing Song, Dec 27 2025
MATHEMATICA
NestList[Round[4*#/3] &, 2, 50] (* Paolo Xausa, Nov 19 2025 *)
PROG
(PARI) A390254_up_to_N(N) = my(v = vector(N+1)); v[1] = 2; for(n=1, N, v[1+n] = round(4*v[n]/3)); v \\ gives a(0..N)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jianing Song, Oct 30 2025
STATUS
approved
