cp's OEIS Frontend

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.

%I A029580 #9 Jul 02 2025 16:01:56
%S A029580 1,5,13,29,61,125,253,509,1021,2045,4093,8189,8191,8193,8195,8197,
%T A029580 8199,8201,8203,8205,8207,8209,8211,8213,8215,8217,8219,8221,8223,
%U A029580 8225,8227,8229,8231,8233,8235,8237,8239,8241,8243,8245,8247,8249,8251,8253,8255
%N 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.
%H A029580 Yasutoshi Kohmoto, <a href="/A029580/a029580.gif">Plot of first 4000 terms</a>
%Y A029580 Cf. A036982.
%K A029580 nonn,easy
%O A029580 0,2
%A A029580 _Yasutoshi Kohmoto_
%E A029580 More terms from _James Sellers_, Aug 08 2000