A392175 - OEIS

%I #34 Jan 26 2026 11:33:39

%S 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,

%T 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

%N a(n) = A375516(n) mod n+1.

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

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

%o (Python)

%o from itertools import count, islice

%o from math import gcd

%o def A392175_gen(): # generator of terms

%o     p, q = 0, 1

%o     for k in count(1):

%o         yield q%k

%o         m = q//(k*(q-p))+1

%o         p, q = p*k*m+q, k*m*q

%o         p //= (r:=gcd(p,q))

%o         q //= r

%o A392175_list = list(islice(A392175_gen(),34)) # _Chai Wah Wu_, Jan 18 2026

%Y Cf. A374663, A375516, A375517.

%K nonn,more

%O 0,5

%A _N. J. A. Sloane_, Jan 16 2026

%E a(15)-a(27) from _Alois P. Heinz_, Jan 16 2026

%E a(28)-a(33) from _Chai Wah Wu_, Jan 18 2026

%E a(34)-a(46) from _Chai Wah Wu_, Jan 20 2026

%E a(47)-a(59) from _Chai Wah Wu_, Jan 26 2026