A370975 a(n) = (A370952(n+1) - A370952(n)) /(2*n+1).

1, 1, -1, 1, 1, 1, -2, 2, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, 1, 1, 1, -1, 1, -1, 1, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -1, -1, 2, -2, 2, 1, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2, -2, 2

Offset: 1

Author

N. J. A. Sloane, Apr 17 2024

Keywords

• sign

Links

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

Crossrefs

Cf. A370952, A372052.

Programs

Python

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