|
| |
|
|
A001597
|
|
Perfect powers: m^k where m is an integer and k >= 2.
(Formerly M3326 N1336)
|
|
217
| |
|
|
1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, 216, 225, 243, 256, 289, 324, 343, 361, 400, 441, 484, 512, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1000, 1024, 1089, 1156, 1225, 1296, 1331, 1369, 1444, 1521, 1600, 1681, 1728, 1764
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Catalan's conjecture (now a theorem) is that 1 occurs just once as a difference, between 8 and 9.
See A175064 for number of ways to write a(n) as m^k (m >= 1, k >= 1). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jan 23 2010]
a(1) = 1, for n >= 2: a(n) = numbers m such that sum of perfect divisors of x = m has no solution. Perfect divisor of n is divisor d such that d^k = n for some k >= 1. a(n) for n >= 2 is complement of A175082. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jan 24 2010]
A075802(a(n)) = 1. [Reinhard Zumkeller, Jun 20 2011]
|
|
|
REFERENCES
| H. W. Gould, Problem H-170, Fib. Quart., 8 (1970), 268.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 66.
D. J. Newman, A Problem Seminar, Springer; see Problem #72.
R. Schoof, Catalan's Conjecture, Springer-Verlag, 2008, p. 1.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| David W. Wilson, Table of n, a(n) for n = 1..10000
A. Dendane, Power (Exponential) Calculator
Serhat Sevki Dincer, Powers up to 2^50
Alf van der Poorten, Remarks on the sequence of 'perfect' powers
M. Waldschmidt, Open Diophantine problems
Eric Weisstein's World of Mathematics, Perfect Power
|
|
|
FORMULA
| Goldbach showed that Sum_{n >= 2} 1/(a(n)-1) = 1.
Formulae from postings to the Number Theory List by various authors, 2002:
Sum_{i=2}^{infty} sum_{j=2}^{infty} 1/i^j =1;
Sum_{k=1}^infty 1/(a_k+1)= pi^2 / 3 - 5/2; (probably the sum should start at k=2)
Sum_{k=1}^infty 1/a_k = sum_{n=2}^infty mu(n)(1- zeta(n)) approx = .87446436840494... (probably the sum should start at k=2)
For asymptotics see Newman.
|
|
|
MAPLE
| isA001597 := proc(n) local e ; e := seq(op(2, p), p=ifactors(n)[2]) ; return ( igcd(e) >=2 ) ; end proc:
A001597 := proc(n) option remember; local a; if n = 1 then 1; else for a from procname(n-1)+1 do if isA001597(a) then return a ; end if; end do; end if; end proc:
seq(A001597(n), n=1..70) ; # R. J. Mathar, Jun 07 2011
|
|
|
MATHEMATICA
| nn = 10^4; Join[{1}, Union[Flatten[Table[n^i, {i, Prime[Range[PrimePi[Log[2, nn]]]]}, {n, 2, nn^(1/i)}]]]] (* T. D. Noe, Apr 18 2011 *)
nn = 10^4; Join[{1}, Union[Flatten[Table[n^i, {i, 2, Log[2, nn]}, {n, 2, nn^(1/i)}]]]] (* Zak Seidov, Jul 14 2011 *)
|
|
|
PROG
| (MAGMA) [1] cat [n : n in [2..1000] | IsPower(n) ];
(PARI) {a(n) = local(m, c); if( n<2, n==1, c=1; m=1; while( c<n, m++; if( ispower(m), c++)); m)} /* Michael Somos Aug 05 2009 */
(Sage)
def A001597_list(n) :
return [k for k in (1..n) if k.is_perfect_power()]
A001597_list(1764) # Peter Luschny, Feb 03 2012
|
|
|
CROSSREFS
| Cf. A023055, A023057, A070428, A074981, A025478.
Cf. A089579, A089580 (number of exact powers < 10^n).
Complement of A007916.
Sequence in context: A080366 A001694 A157985 * A072777 A076292 A090516
Adjacent sequences: A001594 A001595 A001596 * A001598 A001599 A001600
|
|
|
KEYWORD
| nonn,easy,nice,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| Minor corrections from N. J. A. Sloane (njas(AT)research.att.com), Jun 27 2010
|
| |
|
|
