OFFSET
1,1
COMMENTS
a(n)==0 mod 24. It seems that a(n)==0 (mod 2n+1) if and only if 2n+1 is an odd prime.
It appears that a(n)=24 for n in A045979, a(n)=168 for n in A051227, a(n)=264 for n in A051229, and a(n)=240 or 480 if n is in A051225. - Michel Marcus, Dec 07 2013
PROG
(PARI) ds(n, k) = sigma(2*k-1, 2*n+1) - sigma(2*k-1);
a(n) = {my(m = ds(n, 1)); for (k=2, 100, m = gcd(m, ds(n, k)); ); m; } \\ Script computes gcd of 100 terms; for current data, 10 terms are actually sufficient; is there a better way? - Michel Marcus, Dec 07 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 12 2003
EXTENSIONS
a(12) corrected and more terms from Michel Marcus, Dec 07 2013
STATUS
approved