login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015460 q-Fibonacci numbers for q=3. 14
0, 1, 1, 4, 13, 121, 1174, 30577, 886423, 67758322, 5883579625, 1339570631551, 348759063908176, 237649677731273173, 185582515360156234789, 379075929664916795231668, 888014493839316022947740209 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Note that a(2,3,4,5) = {1,4,13,121} coincide with A003462(1,2,3,5). - Zak Seidov, Dec 19 2014

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..90

FORMULA

a(n) = a(n-1) + 3^(n-2) * a(n-2).

Associated constant: C_3 = lim_{n->inf} a(n)*a(n-2)/a(n-1)^2 = 1.147262608254535257774121586... . - Benoit Cloitre, Aug 30 2003

a(n)*a(n+3) - a(n)*a(n+2) - 3*a(n+1)*a(n+2) + 3*a(n+1)^2 = 0. - Emanuele Munarini, Dec 05 2017

MAPLE

q:=3; 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 16 2019

MATHEMATICA

RecurrenceTable[{a[0]==0, a[1]==1, a[n]==a[n-1]+a[n-2]*3^(n-2)}, a, {n, 30}] (* Vincenzo Librandi, Nov 08 2012 *)

F[n_, q_]:= Sum[QBinomial[n-j-1, j, q]*q^(j^2), {j, 0, Floor[(n-1)/2]}];

Table[F[n, 3], {n, 0, 20}] (* G. C. Greubel, Dec 16 2019 *)

PROG

(MAGMA) [0] cat[n le 2 select 1 else Self(n-1) + Self(n-2)*(3^(n-2)): n in [1..20]]; // Vincenzo Librandi, Nov 08 2012

(PARI) q=3; 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 16 2019

(Sage)

def F(n, q): return sum( q_binomial(n-j-1, j, q)*q^(j^2) for j in (0..floor((n-1)/2)))

[F(n, 3) for n in (0..20)] # G. C. Greubel, Dec 16 2019

(GAP) q:=3;; a:=[0, 1];; for n in [3..30] do a[n]:=a[n-1]+q^(n-3)*a[n-2]; od; a; # G. C. Greubel, Dec 16 2019

CROSSREFS

Cf. A003462.

q-Fibonacci numbers: A000045 (q=1), A015459 (q=2), this sequence (q=3), A015461 (q=4), A015462 (q=5), A015463 (q=6), A015464 (q=7), A015465 (q=8), A015467 (q=9), A015468 (q=10), A015469 (q=11), A015470 (q=12).

Sequence in context: A331013 A276912 A045886 * A121813 A197897 A203380

Adjacent sequences:  A015457 A015458 A015459 * A015461 A015462 A015463

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 01:30 EST 2020. Contains 331166 sequences. (Running on oeis4.)