|
Search: id:A115973
|
|
|
| A115973 |
|
Number of distinct prime factors of p^p + 1 where p is prime. |
|
+0
2
|
|
| 1, 2, 3, 3, 6, 5, 3, 5, 8, 7, 7, 7, 6, 8, 10, 8, 9, 8, 7, 8, 4, 7, 12, 6, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Chris Caldwell, The First 1000 Primes.
Dario Alejandro Alpern, Factorization using the Elliptic Curve Method
|
|
EXAMPLE
|
If p=29 then (29^29 + 1) contains 7 distinct prime factors.
|
|
MATHEMATICA
|
f[n_] := Length@ FactorInteger[Prime[n]^Prime[n] + 1]; Array[f, 20] - Robert G. Wilson v (rgwv(at)rgwv.com), Apr 06 2006
|
|
PROGRAM
|
(PARI) { for(n=1, 20, p = prime(n); d = factor(p^p+1); dec=matsize(d); print1(dec[1], ", "); ); } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 29 2006
|
|
CROSSREFS
|
Adjacent sequences: A115970 A115971 A115972 this_sequence A115974 A115975 A115976
Sequence in context: A049990 A062774 A045892 this_sequence A057047 A101447 A119322
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Mar 14 2006
|
|
EXTENSIONS
|
8 more terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 29 2006
a(19)-a(25) from Robert G. Wilson v (rgwv(at)rgwv.com), Apr 06 2006
|
|
|
Search completed in 0.002 seconds
|
