A392175 a(n) = A375516(n) mod n+1.

0, 0, 1, 0, 3, 0, 1, 0, 0, 0, 9, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32, 2, 25, 0, 24, 2, 22, 0, 28, 20, 18, 24, 30, 18, 0, 0, 18, 50, 48, 0

Offset

0,5

Comments

It is a theorem that A375516(n) mod n is 0.

Links

Table of n, a(n) for n=0..59.

Example

A375516(2) = 4, so a(2) = (4 mod 3) = 1.

Prog

(Python)
from itertools import count, islice
from math import gcd
def A392175_gen(): # generator of terms
    p, q = 0, 1
    for k in count(1):
        yield q%k
        m = q//(k*(q-p))+1
        p, q = p*k*m+q, k*m*q
        p //= (r:=gcd(p, q))
        q //= r
A392175_list = list(islice(A392175_gen(), 34)) # Chai Wah Wu, Jan 18 2026

Crossrefs

Cf. A374663, A375516, A375517.

Sequence in context: A374214 A098018 A260073 * A196306 A107093 A051830

Adjacent sequences: A392172 A392173 A392174 * A392176 A392177 A392178

Keyword

nonn,more

Author

N. J. A. Sloane, Jan 16 2026

Extensions

a(15)-a(27) from Alois P. Heinz, Jan 16 2026

a(28)-a(33) from Chai Wah Wu, Jan 18 2026

a(34)-a(46) from Chai Wah Wu, Jan 20 2026

a(47)-a(59) from Chai Wah Wu, Jan 26 2026

Status

approved