id:A029580 - OEIS Search Results

Search: id:A029580

Displaying 1-1 of 1 results found.

page 1

a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.

+0
2

1, 5, 13, 29, 61, 125, 253, 509, 1021, 2045, 4093, 8189, 8191, 8193, 8195, 8197, 8199, 8201, 8203, 8205, 8207, 8209, 8211, 8213, 8215, 8217, 8219, 8221, 8223, 8225, 8227, 8229, 8231, 8233, 8235, 8237, 8239, 8241, 8243, 8245, 8247, 8249, 8251, 8253, 8255 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Yasutoshi Kohmoto, Plot of first 4000 terms`
	CROSSREFS	`Cf. A036982.` `Sequence in context: A093817 A120274 A036982 this_sequence A113914 A050415 A099970` `Adjacent sequences: A029577 A029578 A029579 this_sequence A029581 A029582 A029583`
	KEYWORD	`nonn,easy`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp)`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 08 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research