login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015457 Generalized Fibonacci numbers. 8
1, 1, 12, 133, 1475, 16358, 181413, 2011901, 22312324, 247447465, 2744234439, 30434026294, 337518523673, 3743137786697, 41512034177340, 460375513737437, 5105642685289147, 56622445051918054, 627952538256387741, 6964100365872183205, 77233056562850402996 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

For n>=1, row sums of triangle for numbers 11^k*C(m,k) with duplicated diagonals. - Vladimir Shevelev, Apr 13 2012

For n>=1, a(n) equals the numbers of words of length n-1 on alphabet {0,1,...,11} containing no subwords ii, (i=0,1,...,10). - Milan Janjic, Jan 31 2015

LINKS

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

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (11,1).

FORMULA

a(n) = 11 a(n-1) + a(n-2).

a(n) = Sum_{k, 0<=k<=n}10^k*A055830(n,k). - Philippe Deléham, Oct 18 2006

a(n) = (9/50)*[11/2-(5/2)*sqrt(5)]^n*sqrt(5)+(1/2)*[11/2-(5/2)*sqrt(5)]^n-(9/50)*sqrt(5)*[11/2+(5 /2)*sqrt(5)]^n+(1/2)*[11/2+(5/2)*sqrt(5)]^n, with n>=0. - Paolo P. Lava, Jul 09 2008

G.f.: (1-10*x)/(1-11*x-x^2). [Philippe Deléham, Nov 21 2008]

For n>=2, a(n) = F_n(11)+F_(n+1)(11), where F_n(x) is Fibonacci polynomial (cf.A049310): F_n(x) = sum{i=0,...,floor((n-1)/2)}C(n-i-1,i)x^(n-2*i-1). - Vladimir Shevelev, Apr 13 2012

MATHEMATICA

LinearRecurrence[{11, 1}, {1, 1}, 30] (* Vincenzo Librandi, Nov 08 2012 *)

PROG

(MAGMA) [n le 2 select 1 else 11*Self(n-1) + Self(n-2): n in [1..30]]; // Vincenzo Librandi, Nov 08 2012

CROSSREFS

Row m=11 of A135597.

Sequence in context: A120674 A244205 A016123 * A015469 A144785 A214994

Adjacent sequences:  A015454 A015455 A015456 * A015458 A015459 A015460

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified October 21 05:29 EDT 2017. Contains 293679 sequences.