A029580 a(0) = 1; for n > 0, a(n) = [ A*a(n-1)+B ]/p^r, where p^r is the highest power of p dividing [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.

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

Offset

0,2

Links

Adam Reichert, Table of n, a(n) for n = 0..9999

Yasutoshi Kohmoto, Plot of first 4000 terms

Prog

(Python)
import fractions
import math
def A029580():
    A = fractions.Fraction(200013, 100000)
    B = 3
    p = 2
    a = 1
    while True:
        yield a
        a = math.floor(A * a + B)
        while a % p == 0:
            a //= p
# Adam Reichert, Apr 26 2026

Crossrefs

Cf. A036982.

Sequence in context: A093817 A120274 A036982 * A344920 A113914 A050415

Adjacent sequences: A029577 A029578 A029579 * A029581 A029582 A029583

Keyword

nonn,easy

Author

Yasutoshi Kohmoto

Extensions

More terms from James Sellers, Aug 08 2000

Status

approved