|
Search: id:A036878
|
|
|
| A036878 |
|
Integers of the form p^(p-1), where p is prime. |
|
+0
5
|
|
| 2, 9, 625, 117649, 25937424601, 23298085122481, 48661191875666868481, 104127350297911241532841, 907846434775996175406740561329, 88540901833145211536614766025207452637361
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Also the least refactorable number (A033950) k has the n-th prime as its least prime factor. - Robert G. Wilson v Jun 28 2006.
|
|
LINKS
|
S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999, #2.
S. Colton, HR - Automatic Theory Formation in Pure Mathematics
|
|
EXAMPLE
|
5^{5-1} = 5^4 = 625
|
|
MATHEMATICA
|
Table[Prime@n^(Prime@n - 1), {n, 10}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Jun 28 2006)
|
|
CROSSREFS
|
These integers are refactorable - i.e. the number of divisors divides the number itself, cf. A033950.
Adjacent sequences: A036875 A036876 A036877 this_sequence A036879 A036880 A036881
Sequence in context: A000883 A086693 A085605 this_sequence A008322 A135361 A023366
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Simon Colton (simonco(AT)cs.york.ac.uk)
|
|
|
Search completed in 0.002 seconds
|
