id:A055845 - OEIS Search Results

Search: id:A055845

Displaying 1-1 of 1 results found.

page 1

a(n)=4a(n-1)-a(n-2); a(0)=1, a(1)=8.

+0
1

1, 8, 31, 116, 433, 1616, 6031, 22508, 84001, 313496, 1169983, 4366436, 16295761, 60816608, 226970671, 847066076, 3161293633, 11798108456, 44031140191, 164326452308, 613274669041, 2288772223856 (list; graph; listen)

	OFFSET	`0,2`
	REFERENCES	`A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.`
	LINKS	`Tanya Khovanova, Recursive Sequences`
	FORMULA	`a(n)={8[(2+sqrt(3))^n-(2-sqrt(3))^n]-[(2+sqrt(3))^(n-1) -(2-sqrt(3))^(n-1)]}/2sqrt(3).`
	EXAMPLE	`G.f.(x)=(1+4x)/(1-4x+x^2).`
	CROSSREFS	`Cf. A054485.` `Adjacent sequences: A055842 A055843 A055844 this_sequence A055846 A055847 A055848` `Sequence in context: A115004 A005338 A006322 this_sequence A034556 A121097 A121093`
	KEYWORD	`easy,nonn`
	AUTHOR	`Barry E. Williams, May 31 2000`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research