login
A105117
Minimal number of perfect powers needed to sum to prime(n).
0
2, 3, 2, 4, 3, 2, 2, 3, 4, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 4, 2, 3, 2, 3, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 3, 2, 3, 2, 2, 3, 2, 3, 2, 3, 2, 3
OFFSET
1,1
LINKS
Eric Weisstein's World of Mathematics, Perfect Power.
EXAMPLE
a(4) = 4 since prime(4) = 7 = 1+1+1+4.
a(8) = 3 since prime(8) = 19 = 1+9+9.
a(11) = 2 since prime(11) = 31 = 4+27.
a(14) = 2 since prime(14) = 43 = 16+27.
CROSSREFS
Cf. A001597.
Sequence in context: A277859 A308566 A288535 * A100876 A089215 A238766
KEYWORD
easy,nonn
AUTHOR
Giovanni Teofilatto, Apr 08 2005
EXTENSIONS
Corrected and extended by Ray Chandler, May 05 2005
STATUS
approved