id:A053521 - OEIS Search Results

Search: id:A053521

Displaying 1-1 of 1 results found.

page 1

a(n)=[A*a(n-1)+B*a(n-2)+C]/p^r, where p^r is the highest power of p dividing [A*a(n-1)+B*a(n-2)+C], A=1.0001, B=1.0001, C=1, p=2.

+0
3

1, 1, 3, 5, 9, 15, 25, 41, 67, 109, 177, 287, 465, 753, 1219, 1973, 3193, 5167, 8361, 6765, 1891, 8657, 5275, 6967, 3061, 5015, 8077, 6547, 7313, 6931, 7123, 1757, 881, 665, 9547, 5107, 229, 5337, 5567, 5453, 5511, 5483, 2749, 8233, 1373, 9607 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`Cf. A053522, A053523, A028948.` `Sequence in context: A080430 A053523 A053522 this_sequence A128587 A001595 A092369` `Adjacent sequences: A053518 A053519 A053520 this_sequence A053522 A053523 A053524`
	KEYWORD	`nonn`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)`
	EXTENSIONS	`Becomes a cyclic sequence whose period is 4793. If A=1, B=1, C=0, p=1, a(1)=a(2)=1 then it is the Fibonacci Sequence.`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research