|
| |
|
|
A022132
|
|
Fibonacci sequence beginning 4 13.
|
|
1
| |
|
|
4, 13, 17, 30, 47, 77, 124, 201, 325, 526, 851, 1377, 2228, 3605, 5833, 9438, 15271, 24709, 39980, 64689, 104669, 169358, 274027, 443385, 717412, 1160797, 1878209, 3039006, 4917215, 7956221, 12873436, 20829657, 33703093, 54532750, 88235843, 142768593
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| Contribution from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jul 31 2008: (Start)
G.f.: (4+9*x)/(1-x-x^2).
a(n) = term (1,1) in the 1x2 matrix [4,9] . [1,1; 1,0]^n. (End)
|
|
|
MAPLE
| (Maple) a := n -> (Matrix([[4, 9]]).Matrix([[1, 1], [1, 0]])^n)[1, 1]; seq (a(n), n=0..30); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Jul 31 2008]
|
|
|
MATHEMATICA
| a={}; b=4; c=13; AppendTo[a, b]; AppendTo[a, c]; Do[b=b+c; AppendTo[a, b]; c=b+c; AppendTo[a, c], {n, 4!}]; a [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 17 2008]
|
|
|
CROSSREFS
| Cf. A000032.
Sequence in context: A032824 A107462 A190863 * A041559 A190122 A042713
Adjacent sequences: A022129 A022130 A022131 * A022133 A022134 A022135
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
