|
|
A165901
|
|
a(0)=0, a(1)=1, a(n) = a(n-1) + 2^(n-3)*a(n-2).
|
|
2
|
|
|
0, 1, 1, 2, 4, 12, 44, 236, 1644, 16748, 227180, 4514668, 120830828, 4743850860, 252205386604, 19683018509164, 2085749545569132, 324572324799712108, 68670413434009029484, 21339842291507941739372, 9022108271913939454266220
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
The difference equation y(n, x, s, q) = x*y(n-1, x, s, q) + q^(n-3)*y(n-2, x, s, q) yields the two-variable q-Fibonacci polynomials in the form y(n, x, s, q) = Sum_{j=0..floor((n-1)/2)} q-binomial(n-j-1,j, q)*q^(j*(j-1))*x^(n-2*j-1)*s^j. When x=s=1 these polynomials reduce to q-Fibonacci numbers. This family of q-Fibonacci numbers is different from that of the q-Fibonacci numbers defined in A015459 and A015473. - G. C. Greubel, Dec 17 2019
|
|
LINKS
|
|
|
MAPLE
|
q:=2; seq(add((product((1-q^(n-j-1-k))/(1-q^(k+1)), k=0..j-1))* q^(j*(j-1)), j = 0..floor((n-1)/2)), n = 0..20); # G. C. Greubel, Dec 19 2019
|
|
MATHEMATICA
|
F[n_, q_]:= Sum[QBinomial[n-j-1, j, q]*q^(j*(j-1)), {j, 0, Floor[(n-1)/2]}];
nxt[{n_, a_, b_}]:={n+1, b, b+a*2^(n-2)}; NestList[nxt, {1, 0, 1}, 20][[All, 2]] (* Harvey P. Dale, Oct 03 2021 *)
|
|
PROG
|
(PARI) a(n) = if(n<2, n, a(n-1) + 2^(n-3)*a(n-2));
(Magma) q:=2; I:=[0, 1]; [n le 2 select I[n] else Self(n-1) + q^(n-3)*Self(n-2): n in [1..20]]; // G. C. Greubel, Dec 19 2019
(Sage)
def F(n, q): return sum( q_binomial(n-j-1, j, q)*q^(j*(j-1)) for j in (0..floor((n-1)/2)))
(GAP) q:=2;; a:=[0, 1];; for n in [3..20] do a[n]:=a[n-1]+q^(n-3)*a[n-2]; od; a; # G. C. Greubel, Dec 19 2019
|
|
CROSSREFS
|
q-Fibonacci numbers: A000045 (q=1), this sequence (q=2), A165902 (q=3).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|