A370952 a(1) = 1; for n > 1, a(n) is the least positive integer not already in the sequence such that a(n) == a(n-1) (mod 2*n-1).

1, 4, 9, 2, 11, 22, 35, 5, 39, 20, 41, 18, 43, 16, 45, 14, 47, 12, 49, 10, 51, 8, 53, 6, 55, 106, 159, 104, 161, 102, 163, 37, 167, 33, 171, 29, 175, 25, 179, 21, 183, 17, 187, 13, 191, 100, 7, 197, 3, 201, 302, 96, 306, 92, 310, 88, 314, 84, 318, 80, 322, 76, 326, 72, 330, 68, 334, 64, 338, 60, 342, 56, 346, 52, 350

Offset

1,2

Comments

Very similar to A368382, except that there the differences are controlled by the sequence {2,3,5,7,9,11,13,15,...} (A004280), whereas here they are controlled by {3,5,7,9,11,13,15,...}.

Links

Chai Wah Wu, Table of n, a(n) for n = 1..10000

Prog

(Python)
from itertools import count, islice
def A370952_gen(): # generator of terms
    a, aset = 1, {0, 1}
    for p in count(3, 2):
        yield a
        for b in count(a%p, p):
            if b not in aset:
                aset.add(b)
                a = b
                break
A370952_list = list(islice(A370952_gen(), 20)) # Chai Wah Wu, Apr 17 2024

Crossrefs

Cf. A004280, A368382, A370975, A372052 (where n appears).

Sequence in context: A203816 A070437 A238324 * A128204 A079049 A366908

Adjacent sequences: A370949 A370950 A370951 * A370953 A370954 A370955

Keyword

nonn,changed

Author

N. J. A. Sloane, Mar 07 2024.

Status

approved