|
|
A178629
|
|
Numbers k such that A003418(k-1) = lcm(1,2,...,k-1) is congruent to 1 modulo k.
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Numbers k such that A158851(k-1) = 1.
k must be prime.
|
|
LINKS
|
|
|
EXAMPLE
|
For the first nontrivial example: lcm(1,2,3,4,5,6,7,8,9,10) = 2520 and 2520 mod 11 = 1, so 11 is in the sequence.
|
|
MATHEMATICA
|
fQ[n_] := Mod[ LCM @@ Range[n - 1], n] == 1; k = 2; lst = {}; While[k < 10^6, If[ fQ@k, Print@k; AppendTo[lst, k]]; k++ ]; lst (* Robert G. Wilson v, Jun 02 2010 *)
|
|
PROG
|
(PARI) { L=1; for(n=2, 10^8, if( ispseudoprime(n), if(L%n==1, print(n)); L*=n); if( ispower(n, , &p) && ispseudoprime(p), L*=p ); ) } \\ Max Alekseyev, Jun 19 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|