STATUS
proposed
approved
proposed
approved
editing
proposed
f[n_] := Length@ FactorInteger[Prime[n]^Prime[n] + 1]; Array[f, 20] - _(* _Robert G. Wilson v_, Apr 06 2006 *)
(PARI) { for(n=1, 20, p = prime(n); d = factor(p^p+1); dec=matsize(d); print1(dec[1], ", "); ); } - _\\ _R. J. Mathar_, Mar 29 2006
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
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, 7, 12, 9, 11, 6, 9, 7, 17, 9, 9
a(33), -a(34) from Hugo Pfoertner, Aug 07 2019
a(28) corrected by Sean A. Irvine, Aug 04 2023
approved
editing
proposed
approved
editing
proposed
Dario Alejandro Alpern, <a href="httphttps://www.alpertron.com.ar/ECM.HTM">Factorization using the Elliptic Curve Method</a>
approved
editing