|
Search: id:A104449
|
|
|
| A104449 |
|
Fibonacci-type sequence. Each term is the sum of the two previous terms. |
|
+0
3
|
|
| 3, 1, 4, 5, 9, 14, 23, 37, 60, 97, 157, 254, 411, 665, 1076, 1741, 2817, 4558, 7375, 11933, 19308, 31241, 50549, 81790, 132339, 214129, 346468, 560597, 907065, 1467662, 2374727, 3842389, 6217116
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The 6th row in the Wythoff array begins with the 6th term of the sequence (14, 23, 37, 60, 97, 157,...). a(n) = f(n-3) + f(n+2) for the Fibonacci numbers f(n) = f(n-1) + f(n-2); f(0) = 0, f(1) = 1.
|
|
REFERENCES
|
V. E. Hoggatt, Jr., Fibonacci and Lucas Numbers. Houghton, Boston, MA, 1969.
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
R. Knott, Fibonacci Numbers and the Golden Section .
Eric Weisstein's World of Mathematics, Fibonacci Number.
|
|
FORMULA
|
a(n) = a(n-1) + a(n-2); a(0) = 3, a(1) = 1
a(n)=3*fibonacci(n-1)+fibonacci(n), n>=0. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
G.f.: (3-2x)/(1-x-x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 19 2008]
|
|
MAPLE
|
a:=n->3*fibonacci(n-1)+fibonacci(n): seq(a(n), n=0..32); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
|
|
CROSSREFS
|
Cf. Other Fibonacci-type sequences: A000045, A000032, A013655. Other related sequences: A103343, A103344. Wythoff array: A035513.
Essentially the same as A000285.
Adjacent sequences: A104446 A104447 A104448 this_sequence A104450 A104451 A104452
Sequence in context: A068399 A105177 A050057 this_sequence A116416 A051203 A086271
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Casey Mongoven (cm(AT)caseymongoven.com), Mar 08 2005
|
|
|
Search completed in 0.002 seconds
|
