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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022346 Fibonacci sequence beginning 0, 12. 2
0, 12, 12, 24, 36, 60, 96, 156, 252, 408, 660, 1068, 1728, 2796, 4524, 7320, 11844, 19164, 31008, 50172, 81180, 131352, 212532, 343884, 556416, 900300, 1456716, 2357016, 3813732, 6170748, 9984480, 16155228, 26139708, 42294936, 68434644, 110729580, 179164224, 289893804, 469058028, 758951832, 1228009860 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 15.

LINKS

Table of n, a(n) for n=0..40.

Tanya Khovanova, Recursive Sequences

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

FORMULA

a(n) = 12*F(n) = F(n+5) + F(n-1) + F(n-3) + F(n-6) for n>5, where F=A000045.

G.f.: 12*x/(1-x-x^2). - Philippe Deléham, Nov 20 2008

a(n) = F(n+6) + F(n-6) - 6*F(n). - Bruno Berselli, Dec 29 2016

MATHEMATICA

LinearRecurrence[{1, 1}, {0, 12}, 40] (* Harvey P. Dale, May 07 2016 *)

PROG

(PARI) a(n)=12*fibonacci(n) \\ Charles R Greathouse IV, Aug 28 2014

CROSSREFS

Cf. A000045.

Sequence in context: A260526 A040133 A092538 * A174020 A173549 A251643

Adjacent sequences:  A022343 A022344 A022345 * A022347 A022348 A022349

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

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 June 24 05:50 EDT 2017. Contains 288697 sequences.