cp's OEIS Frontend

A015469 q-Fibonacci numbers for q=11, scaling a(n-2).

%I A015469 #14 Feb 03 2025 06:49:51
%S A015469 0,1,1,12,133,16105,1963358,2595689713,3480804151551,
%T A015469 50586130104323474,746191869036731097905,119280194867984161366496439,
%U A015469 19354414621214347335584253057344,34032051023004810891710239239325511573
%N A015469 q-Fibonacci numbers for q=11, scaling a(n-2).
%H A015469 Vincenzo Librandi, <a href="/A015469/b015469.txt">Table of n, a(n) for n = 0..60</a>
%F A015469 a(n) = a(n-1) + 11^(n-2)*a(n-2).
%p A015469 q:=11; seq(add((product((1-q^(n-j-1-k))/(1-q^(k+1)), k=0..j-1))*q^(j^2), j = 0..floor((n-1)/2)), n = 0..20); # _G. C. Greubel_, Dec 17 2019
%t A015469 RecurrenceTable[{a[0]==0, a[1]==1, a[n]==a[n-1]+a[n-2]*11^(n-2)},  a, {n, 61}] (* _Vincenzo Librandi_, Nov 09 2012 *)
%t A015469 F[n_, q_]:= Sum[QBinomial[n-j-1, j, q]*q^(j^2), {j, 0, Floor[(n-1)/2]}];
%t A015469 Table[F[n, 11], {n, 0, 20}] (* _G. C. Greubel_, Dec 17 2019 *)
%o A015469 (Magma) [0] cat[n le 2 select 1 else Self(n-1) + Self(n-2)*(11^(n-2)): n in [1..15]]; // _Vincenzo Librandi_, Nov 09 2012
%o A015469 (PARI) q=11; m=20; v=concat([0,1], vector(m-2)); for(n=3, m, v[n]=v[n-1]+q^(n-3)*v[n-2]); v \\ _G. C. Greubel_, Dec 17 2019
%o A015469 (Sage)
%o A015469 def F(n,q): return sum( q_binomial(n-j-1, j, q)*q^(j^2) for j in (0..floor((n-1)/2)))
%o A015469 [F(n,11) for n in (0..20)] # _G. C. Greubel_, Dec 17 2019
%o A015469 (GAP) q:=11;; 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 17 2019
%Y A015469 q-Fibonacci numbers: A000045 (q=1), A015459 (q=2), A015460 (q=3), A015461 (q=4),
%Y A015469 A015462 (q=5), A015463 (q=6), A015464 (q=7), A015465 (q=8), A015467 (q=9), A015468 (q=10), this sequence (q=11), A015470 (q=12).
%K A015469 nonn,easy
%O A015469 0,4
%A A015469 _Olivier Gérard_