OFFSET
0,1
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..14
MAPLE
s:= proc(n) s(n):= `if`(n=0, 0, s(n-1)+1/(n*b(n))) end:
b:= proc(n) b(n):= 1+floor(1/((1-s(n-1))*n)) end:
a:= n-> denom(s(n+1))/denom(s(n)):
seq(a(n), n=0..10); # Alois P. Heinz, Oct 19 2024
MATHEMATICA
s[n_] := s[n] = If[n == 0, 0, s[n-1] + 1/(n*b[n])];
b[n_] := b[n] = 1 + Floor[1/((1 - s[n-1])*n)];
a[n_] := Denominator[s[n+1]]/Denominator[s[n]];
Table[a[n], {n, 0, 10}] (* Jean-François Alcover, Jul 02 2025, after Alois P. Heinz *)
PROG
(PARI) { r = 1; for (n = 1, 11, a = floor(1/(r*n))+1; d = denominator(r); r -= 1/(n*a); print1 (denominator(r)/d", "); ); }
(Python)
from itertools import count, islice
from math import gcd
def A375791_gen(): # generator of terms
p, q = 0, 1
for k in count(1):
m = q//(k*(q-p))+1
p, q = p*k*m+q, k*m*q
p //= (r:=gcd(p, q))
q //= r
yield k*m//r
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist and N. J. A. Sloane, Aug 29 2024
STATUS
approved
