Largest number m such that a^n = 1 (mod m) whenever a is prime to m.
2, 24, 2, 240, 2, 504, 2, 480, 2, 264, 2, 65520, 2, 24, 2, 16320, 2, 28728, 2, 13200, 2
5 seqfan posts
Fri May 28 08:23:20 CEST 2010 [seqfan] Re: min(d(p^n-1)) for sufficiently large p
Thu May 27 22:47:05 CEST 2010 [seqfan] Re: min(d(p^n-1)) for sufficiently large p
Thu May 27 20:38:43 CEST 2010 [seqfan] Re: min(d(p^n-1)) for sufficiently large p
Thu May 27 20:07:06 CEST 2010 [seqfan] Re: min(d(p^n-1)) for sufficiently large p
Thu May 27 13:51:53 CEST 2010 [seqfan] min(d(p^n-1)) for sufficiently large p
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.