|
Search: id:A001039
|
|
|
| A001039 |
|
(p^p-1)/(p-1) where p is prime.
(Formerly M2964 N1199)
|
|
+0
2
|
|
| 3, 13, 781, 137257, 28531167061, 25239592216021, 51702516367896047761, 109912203092239643840221, 949112181811268728834319677753, 91703076898614683377208150526107718802981
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
REFERENCES
|
T. S. Motzkin, Sorting numbers ...: for a link to this paper see A000262.
T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176.
J. Levine and R. E. Dalton, Minimum periods, modulo p, of first-order Bell exponential integers, Math. Comp., 16 (1962), 416-423.
|
|
MAPLE
|
with(numtheory): for i from 1 to 20 do printf(`%d, `, (ithprime(i)^ithprime(i) -1)/(ithprime(i)-1)) od:
|
|
MATHEMATICA
|
Table[(Prime[n]^Prime[n] - 1)/(Prime[n] - 1), {n, 1, 10}]
|
|
CROSSREFS
|
Adjacent sequences: A001036 A001037 A001038 this_sequence A001040 A001041 A001042
Sequence in context: A066266 A092845 A089711 this_sequence A065831 A092540 A118628
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 10 2000
|
|
|
Search completed in 0.002 seconds
|
