|
Search: id:A072995
|
|
|
| A072995 |
|
Least k such that the number of solutions to x^k==1 (mod k) 1<=x<=k is equal to n. |
|
+0
2
|
|
| 1, 4, 9, 8, 25, 18, 49, 16, 27, 50, 121, 36, 169, 98, 225, 32, 289, 54, 361, 110, 147, 242, 529, 72, 125, 338, 81, 196, 841
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) coincides with A050399(n) for the 29 first terms but should eventually deviate from it.
The sequence seems difficult to extend, as the next term a(30) is larger than 5100. However, a(32)=64, a(64)=128, and a(128)=256 can be easily calculated. It thus appears that a(2^k)=2^(k+1), for k=1,2,3,.... Is this known to be true? - John W. Layman (layman(AT)math.vt.edu), Aug 05 2003
a(30), if it exists, is greater than 400000. - Ryan Propper (rpropper(AT)stanford.edu), Sep 10 2005
|
|
CROSSREFS
|
Sequence in context: A118585 A067666 A050399 this_sequence A073395 A064549 A087687
Adjacent sequences: A072992 A072993 A072994 this_sequence A072996 A072997 A072998
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 21 2002
|
|
|
Search completed in 0.002 seconds
|
