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”).

A015481
q-Fibonacci numbers for q=9.
15
0, 1, 9, 730, 532179, 3491627149, 206177092053480, 109570959981485091829, 524074504891889945272313781, 22559688995294431207802541840253930, 8740085742244887761578226267084082717085551
OFFSET
0,3
LINKS
FORMULA
a(n) = 9^(n-1)*a(n-1) + a(n-2).
MAPLE
q:=9; seq(add((product((1-q^(2*(n-j-1-k)))/(1-q^(2*k+2)), k=0..j-1))* q^binomial(n-2*j, 2), j = 0..floor((n-1)/2)), n = 0..20); # G. C. Greubel, Dec 18 2019
MATHEMATICA
RecurrenceTable[{a[0]==0, a[1]==1, a[n]==9^(n-1) a[n-1]+a[n-2]}, a[n], {n, 10}] (* Harvey P. Dale, Aug 24 2012 *)
F[n_, q_]:= Sum[QBinomial[n-j-1, j, q^2]*q^Binomial[n-2*j, 2], {j, 0, Floor[(n-1)/2]}]; Table[F[n, 9], {n, 0, 20}] (* G. C. Greubel, Dec 18 2019 *)
PROG
(PARI) q=9; m=20; v=concat([0, 1], vector(m-2)); for(n=3, m, v[n]=q^(n-2)*v[n-1]+v[n-2]); v \\ G. C. Greubel, Dec 18 2019
(Magma) q:=9; I:=[0, 1]; [n le 2 select I[n] else q^(n-2)*Self(n-1) + Self(n-2): n in [1..20]]; // G. C. Greubel, Dec 18 2019
(Sage)
def F(n, q): return sum( q_binomial(n-j-1, j, q^2)*q^binomial(n-2*j, 2) for j in (0..floor((n-1)/2)))
[F(n, 9) for n in (0..20)] # G. C. Greubel, Dec 18 2019
(GAP) q:=9;; a:=[0, 1];; for n in [3..20] do a[n]:=q^(n-2)*a[n-1]+a[n-2]; od; a; # G. C. Greubel, Dec 18 2019
CROSSREFS
q-Fibonacci numbers: A000045 (q=1), A015473 (q=2), A015474 (q=3), A015475 (q=4), A015476 (q=5), A015477 (q=6), A015479 (q=7), A015480 (q=8), this sequence (q=9), A015482 (q=10), A015484 (q=11), A015485 (q=12).
Differs from A015467.
Sequence in context: A255510 A122251 A234611 * A229930 A185274 A246122
KEYWORD
nonn,easy
STATUS
approved