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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164828 Generalized Fibonacci numbers. 0
1, 1, 11, 120, 122, 1331, 1462, 15960, 17413, 190081, 207503, 2265120, 2472614, 26991251, 29463874, 321630000, 351093865, 3832568641, 4183662515, 45669193800, 49852856306, 544197756851, 594050613166, 6484703888520, 7078754501677, 77272248905281 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..26.

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

FORMULA

For n odd a(n) = 11a(n-2) + a(n-3), for n even a(n) = 11a(n-1)- a(n-3); with a(1,2) = 1 (For Fibonacci sequence: factor 2 instead of 11).

G.f.: x*(1+x+109*x^3-10*x^4)/((1+x^2)*(1-12*x^2+x^4)). [Colin Barker, Jul 27 2012]

MATHEMATICA

LinearRecurrence[{0, 11, 0, 11, 0, -1}, {1, 1, 11, 120, 122, 1331}, 30] (* Harvey P. Dale, Jun 14 2014 *)

CROSSREFS

Cf. A000045, A041059.

Sequence in context: A163447 A254600 A060499 * A060498 A274119 A171316

Adjacent sequences:  A164825 A164826 A164827 * A164829 A164830 A164831

KEYWORD

nonn,easy

AUTHOR

Mark Dols, Aug 27 2009

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 December 3 10:38 EST 2016. Contains 278699 sequences.