A083261 a(n) = gcd(A046523(n+1), A046523(n)).

1, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 6, 2, 2, 2, 2, 2, 6, 6, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 6, 6, 6, 2, 2, 6, 6, 2, 2, 2, 2, 12, 6, 2, 2, 4, 4, 6, 6, 2, 2, 6, 6, 6, 6, 2, 2, 2, 2, 6, 4, 2, 6, 2, 2, 6, 6, 2, 2, 2, 2, 6, 12, 6, 6, 2, 2, 16, 2, 2, 2, 6, 6, 6, 6, 2, 2, 6, 6, 6, 6, 6, 6, 2, 2, 12, 12, 2, 2, 2, 2

Offset: 1

Author

Labos Elemer, May 09 2003

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A046523, A071364, A083255, A083256, A083257, A083258, A083259, A083260, A286255.

Programs

PARI

A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from Charles R Greathouse IV, Aug 17 2011
A083261(n) = gcd(A046523(n),A046523(1+n)); \\ From Antti Karttunen, May 21 2017