|
Search: id:A071871
|
|
|
| A071871 |
|
(1^(p-1)+2^(p-1)+3^(p-1)+...+(p-1)^(p-1)+1)/p, where p = n-th prime. |
|
+0
1
|
|
| 1, 2, 71, 9596, 1355849266, 1032458258547, 1653031004194447737, 3167496749732497119310, 22841077183004879532481321652, 1768861419039838982256898243427529138091
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Always an integer from little Fermat theorem. Converse is conjectured to be true : "if p | (1 + 1^(p-1)+2^(p-1)+3^(p-1)+...+(p-1)^(p-1) ) p is prime " That was checked by Giuga until p <= 10^1000.
|
|
PROGRAM
|
(PARI) for(n=1, 20, print1((1+sum(i=1, prime(n)-1, i^(prime(n)-1)))/prime(n), ", "))
|
|
CROSSREFS
|
Sequence in context: A157368 A095935 A081368 this_sequence A055030 A053318 A163274
Adjacent sequences: A071868 A071869 A071870 this_sequence A071872 A071873 A071874
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 09 2002
|
|
|
Search completed in 0.002 seconds
|
