Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 11 2021 09:46:35
%S 10,7,311,127,23,157,343927,7805561,47,9629,311,25679,821,1470086279,
%T 12409,71233,1232333,2443783,2939291,71711,352883,181113265579,167,
%U 105199,3881,1314520253,619,20759,117503,1162660843,1880415721,263
%N Quotients A128356(n)/prime(n).
%C A128356 = {20, 21, 1555, 889, 253, 2041, 5846759, ...} = Least number k>1 (that is not the power of prime p) such that k divides (p+1)^k-1, where p = prime(n). Most listed terms are primes, except a(7) = 20231*17 and a(8) = 410819*19. a(15) = 12409. a(16) = 71233.
%C Note that all prime listed terms of {a(n)} coincide with terms of A128456 = {2, 7, 311, 127, 23, 157, 7563707819165039903, 75368484119, 47, 9629, 311, 25679, 821, ...} = least prime factor of ((p+1)^p - 1)/p^2, where p = prime(n).
%Y Cf. A128356 (least number k > 1 (that is not a power of prime p) such that k divides (p+1)^k-1, where p = prime(n)).
%Y Cf. A014960, A128360, A128358, A014960, A014956, A014951, A014949, A014946, A014945, A067945.
%Y Cf. A128456 (least prime factor of ((p+1)^p - 1)/p^2, where p = prime(n)).
%K hard,nonn
%O 1,1
%A _Alexander Adamchuk_, Mar 02 2007, Mar 09 2007
%E Terms a(14) onwards from _Max Alekseyev_, Feb 08 2010