|
| |
|
|
A022130
|
|
Fibonacci sequence beginning 4,9.
|
|
4
| |
|
|
4, 9, 13, 22, 35, 57, 92, 149, 241, 390, 631, 1021, 1652, 2673, 4325, 6998, 11323, 18321, 29644, 47965, 77609, 125574, 203183, 328757, 531940, 860697, 1392637, 2253334, 3645971, 5899305, 9545276, 15444581, 24989857, 40434438, 65424295, 105858733, 171283028
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| The associated Pisano series starts as in A001175, but differs for example for modulus 29 where it is 7, not 14. - R. J. Mathar, Nov 02 2011
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
H. Zhao and X. Li, On the Fibonacci numbers of trees, Fib. Quart., 44 (2006), 32-38.
Index entries for sequences related to linear recurrences with constant coefficients, signature (1,1).
|
|
|
FORMULA
| a(n) = 4*F(n)+F(n-2).
G.f.: (4+5x)/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 19 2008]
|
|
|
MATHEMATICA
| a={}; b=4; c=9; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 1, 40, 1}]; a (Vladimir Orlovsky, Jul 23 2008)
LinearRecurrence[{1, 1}, {4, 9}, 40] (* From Harvey P. Dale, Dec 15 2011 *)
|
|
|
PROG
| (PARI) a(n)=4*fibonacci(n-1)+9*fibonacci(n) \\ Charles R Greathouse IV, Jun 05, 2011
|
|
|
CROSSREFS
| Cf. A000032.
Sequence in context: A035104 A141224 A064423 * A042125 A041905 A098004
Adjacent sequences: A022127 A022128 A022129 * A022131 A022132 A022133
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
