login
A247230
Maximum of the greatest prime factors of (i^prime(n)-1)/(i-1), when i runs through all integers in [2, prime(n)].
0
3, 13, 71, 55987, 12207031, 16148168401, 50544702849929377, 109912203092239643840221, 26552618219228090162977481, 582595509837473004489665028935473297399, 568972471024107865287021434301977158534824481, 4673016293261684390446904937094157950067612234753
OFFSET
1,1
COMMENTS
If in the definition "maximum" is replaced with "minimum," then we obtain A247229.
FORMULA
a(n)==1 (mod prime(n)).
PROG
(PARI) a(n) = {maxi = 0; p = prime(n); for (i=2, p, f = factor((i^p-1)/(i-1)); gpf = f[#f~, 1]; if (! maxi, maxi = gpf, maxi = max(maxi, gpf)); ); maxi; } \\ Michel Marcus, Dec 09 2014
CROSSREFS
Sequence in context: A059032 A214812 A188051 * A047159 A086662 A293195
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Nov 27 2014
EXTENSIONS
More terms from Peter J. C. Moses, Nov 27 2014
STATUS
approved