cp's OEIS Frontend

A015477 q-Fibonacci numbers for q=6, scaling a(n-1).

%I A015477 #18 Feb 03 2025 06:59:50
%S A015477 0,1,6,217,46878,60754105,472423967358,22041412681808953,
%T A015477 6170184900967295034366,10363541282645125629123492409,
%U A015477 104440618529953822157016270251244030,6315124821581059445960128077000914860421689
%N A015477 q-Fibonacci numbers for q=6, scaling a(n-1).
%H A015477 Vincenzo Librandi, <a href="/A015477/b015477.txt">Table of n, a(n) for n = 0..50</a>
%F A015477 a(n) = 6^(n-1)*a(n-1) + a(n-2).
%p A015477 q:=6; 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 17 2019
%t A015477 RecurrenceTable[{a[0]==0, a[1]==1, a[n]==a[n-1]*6^(n-1) + a[n-2]},  a, {n, 20}] (* _Vincenzo Librandi_, Nov 09 2012 *)
%t A015477 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, 6], {n, 0, 20}] (* _G. C. Greubel_, Dec 17 2019 *)
%o A015477 (PARI) q=6; 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 17 2019
%o A015477 (Magma) q:=6; 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 17 2019
%o A015477 (Sage)
%o A015477 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)))
%o A015477 [F(n,6) for n in (0..20)] # _G. C. Greubel_, Dec 17 2019
%o A015477 (GAP) q:=6;; 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 17 2019
%Y A015477 q-Fibonacci numbers: A000045 (q=1), A015473 (q=2), A015474 (q=3), A015475 (q=4), A015476 (q=5), this sequence (q=6), A015479 (q=7), A015480 (q=8), A015481 (q=9), A015482 (q=10), A015484 (q=11), A015485 (q=12).
%Y A015477 Differs from A015463.
%K A015477 nonn,easy
%O A015477 0,3
%A A015477 _Olivier Gérard_