id:A022091 - OEIS Search Results

Search: id:A022091

Displaying 1-1 of 1 results found.

page 1

A022091

Fibonacci sequence beginning 0 8.

+0
1

0, 8, 8, 16, 24, 40, 64, 104, 168, 272, 440, 712, 1152, 1864, 3016, 4880, 7896, 12776, 20672, 33448, 54120, 87568, 141688, 229256, 370944, 600200, 971144, 1571344, 2542488, 4113832, 6656320, 10770152 (list; graph; listen)

	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	`Tanya Khovanova, Recursive Sequences`
	FORMULA	`a(n) = round( (16phi-8)/5 phi^n) (works for n>4) - Thomas Baruchel, Sep 08 2004` `a(n) = 8F(n) = F(n+4) + F(n) + F(n-4), n>3.`
	CROSSREFS	`Sequence in context: A040057 A028997 A112439 this_sequence A135405 A006784 A061156` `Adjacent sequences: A022088 A022089 A022090 this_sequence A022092 A022093 A022094`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research