login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A029580 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. 2

%I

%S 1,5,13,29,61,125,253,509,1021,2045,4093,8189,8191,8193,8195,8197,

%T 8199,8201,8203,8205,8207,8209,8211,8213,8215,8217,8219,8221,8223,

%U 8225,8227,8229,8231,8233,8235,8237,8239,8241,8243,8245,8247,8249,8251,8253,8255

%N 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.

%H Yasutoshi Kohmoto, <a href="/A029580/a029580.gif">Plot of first 4000 terms</a>

%Y Cf. A036982.

%K nonn,easy

%O 0,2

%A _Yasutoshi Kohmoto_

%E More terms from _James A. Sellers_, Aug 08 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 17:48 EDT 2019. Contains 324222 sequences. (Running on oeis4.)