A001597 -id:A001597 - cp's OEIS frontend

A376560 Points of upward concavity in the sequence of perfect-powers (A001597). Positives of A376559.

1, 3, 4, 6, 8, 9, 10, 11, 12, 15, 16, 17, 20, 22, 23, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 41, 42, 43, 44, 46, 47, 48, 49, 50, 53, 54, 55, 57, 58, 60, 61, 62, 63, 64, 65, 67, 68, 69, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 88, 89, 90, 91

Offset: 1

Gus Wiseman, Sep 30 2024

nonn

These are points at which the second differences are positive.
Perfect-powers (A001597) are numbers with a proper integer root.
Note that, for some sources, upward concavity is negative curvature.

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, 33, ...
with first differences (A376559):
  1, -3, 6, 2, -7, 3, -1, 9, 2, 2, 2, 2, -17, -1, 13, 9, 2, -7, -11, 9, -5, 20, 2, ...
with positive positions (A376560):
  1, 3, 4, 6, 8, 9, 10, 11, 12, 15, 16, 17, 20, 22, 23, 26, 27, 28, 31, 32, 33, 34, ...

Robert Israel, Table of n, a(n) for n = 1..10000
Gus Wiseman, Points of upward concavity in the perfect-powers.

The version for A000002 is A022297, complement A025505. See also A054354, A376604.
For first differences we have A053289, union A023055, firsts A376268, A376519.
For primes instead of perfect-powers we have A258025.
These are positions of positive terms in A376559.
For downward concavity we have A376561 (probably the complement).
A001597 lists the perfect-powers.
A064113 lists positions of adjacent equal prime gaps.
A333254 gives run-lengths of differences between consecutive primes.
Second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376596 (prime-power), A376599 (non-prime-power).
Cf. A006549, A025475, A030173, A045542, A052410, A053707, A054819, A069623, A174965, A216765, A251092, A376308.

N:= 10^6: # to use perfect powers <= N
S:= {1,seq(seq(i^j,j=2..floor(log[i](N))),i=2..isqrt(N))}:
L:= sort(convert(S,list)):
DL:= L[2..-1]-L[1..-2]:
D2L:= DL[2..-1]-DL[1..-2]:
select(i -> D2L[i]>0, [$1..nops(D2L)]); # Robert Israel, Dec 01 2024

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
Join@@Position[Sign[Differences[Select[Range[1000],perpowQ],2]],1]

A113505 Numbers not the sum of at most three perfect powers (A001597).

Original entry on oeis.org

7, 15, 23, 87, 111, 119, 167, 335, 1391, 1455, 1607, 1679, 1991, 25887, 26375

Offset: 1

R. P. van der Hilst (R.P.vanderHilst(AT)students.uu.nl), Jan 12 2006

Cannot be written in the form a^x + b^y + c^z with a, b, c >= 0 and x, y, z > 1.
a(16), if it exists, is larger than 10^8. - Giovanni Resta, May 07 2017
From Brian Trial, Jun 07 2025: (Start)
Per Legendre's three-square theorem (A004215) only integers of the form 4^i(8j+7) are eligible.
Every integer > 5042631 (= 1424^2 + 734*2 + 19^5) and < 10^9 can be expressed as either a^2 + b^2 + c^2 or a^2 + b^2 + c^3, a,b,c >= 0 so a(16) >= 10^9. (End)

Eric Weisstein's World of Mathematics, Perfect Power
Eric Weisstein's World of Mathematics, Powerful Number.

A056828 is a subset, A001694, A274459.

lmt = 40000; s = Union@ Join[{0, 1}, Flatten@ Table[n^i, {n, 2, Sqrt@ lmt}, {i, 2, Log[n, lmt]}]]; t = Select[ Union[Plus @@@ Tuples[s, 3]], # < lmt + 1 &]; Complement[Range@ lmt, t] (* Robert G. Wilson v *)

Edited by Robert G. Wilson v, May 01 2006

A091624 Lesser of consecutive primes whose sum is a perfect power (A001597).

Original entry on oeis.org

3, 17, 47, 61, 71, 107, 283, 881, 1151, 1913, 2591, 3527, 4049, 4093, 6047, 7193, 7433, 10973, 15137, 20807, 21617, 24197, 26903, 28793, 34847, 37039, 46817, 53129, 56443, 69191, 74489, 83231, 84047, 98563, 103049, 103967, 109507, 110441, 112337

Offset: 1

Robert G. Wilson v, Jan 24 2004

nonn

Hans Havermann, Table of n, a(n) for n = 1..10000

Cf. A071087.

Cf. A061275.

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; PrimeExponents[n_] := Flatten[ Table[ #[[2]], {1}] & /@ FactorInteger[n]]; p = q = 2; l = {}; Do[q = NextPrim[p]; If[ Apply[ GCD, PrimeExponents[p + q]] > 1, AppendTo[l, p]]; p = q, {n, 2, 13000}]

A253642 Number of ways the perfect power A001597(n) can be written as a^b, with a, b > 1.

Original entry on oeis.org

0, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

M. F. Hasler, Jan 25 2015

nonn

Run lengths of A072103. Also, the terms a(n) which exceed 1 constitute A175066. - Andrey Zabolotskiy, Aug 17 2016

			a(1)=0 since A001597(1)=1 can be written as a^b for a=1 and any b, but not using a base a > 1.
a(2)=a(3)=a(4)=1 since the following terms 4=2^2, 8=2^3 and 9=3^2 can be written as perfect powers in only one way.
a(5)=2 since A001597(5)=16=a^b for (a,b)=(2,4) and (4,2).

Cf. A001597, A072103, A175064, A253641.

for(n=1,9999,(e=ispower(n))&&print1(numdiv(e)-1,","))

from math import gcd
from sympy import mobius, integer_nthroot, divisor_count, factorint
def A253642(n):
    if n == 1: return 0
    def f(x): return int(n-2+x+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
    kmin, kmax = 1,2
    while f(kmax) >= kmax:
        kmax <<= 1
    while True:
        kmid = kmax+kmin>>1
        if f(kmid) < kmid:
            kmax = kmid
        else:
            kmin = kmid
        if kmax-kmin <= 1:
            break
    return divisor_count(gcd(*factorint(kmax).values()))-1 # Chai Wah Wu, Aug 13 2024

a(n) = A000005(A253641(A001597(n))) - 1.

a(n) = A175064(n) - 1.

A376561 Points of downward concavity in the sequence of perfect-powers (A001597).

Original entry on oeis.org

2, 5, 7, 13, 14, 18, 19, 21, 24, 25, 29, 30, 39, 40, 45, 51, 52, 56, 59, 66, 70, 71, 74, 87, 94, 101, 102, 108, 110, 112, 113, 119, 127, 135, 143, 144, 156, 157, 160, 161, 169, 178, 187, 196, 205, 206, 215, 224, 225, 234, 244, 263, 273, 283, 284, 293, 294, 304

Offset: 1

Gus Wiseman, Sep 30 2024

nonn

These are points at which the second differences are negative.
Perfect-powers (A001597) are numbers with a proper integer root.
Note that, for some sources, downward concavity is positive curvature.
From Robert Israel, Oct 31 2024: (Start)
The first case of two consecutive numbers in the sequence is a(4) = 13 and a(5) = 14.
The first case of three consecutive numbers is a(293) = 2735, a(294) = 2736, a(295) = 2737.
The first case of four consecutive numbers, if it exists, involves a(k) with k > 69755. (End)

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, 33, ...
with first differences (A376559):
  1, -3, 6, 2, -7, 3, -1, 9, 2, 2, 2, 2, -17, -1, 13, 9, 2, -7, -11, 9, -5, 20, 2, ...
with negative positions (A376561):
  2, 5, 7, 13, 14, 18, 19, 21, 24, 25, 29, 30, 39, 40, 45, 51, 52, 56, 59, 66, 70, ...

Robert Israel, Table of n, a(n) for n = 1..10000
Gus Wiseman, Points of downward concavity in the perfect-powers.

The version for A000002 is A025505, complement A022297. See also A054354, A376604.
For first differences we have A053289, union A023055, firsts A376268, A376519.
For primes instead of perfect-powers we have A258026.
For upward concavity we have A376560 (probably the complement).
A000961 lists the prime-powers inclusive, exclusive A246655.
A001597 lists the perfect-powers.
A007916 lists the non-perfect-powers.
A112344 counts partitions into perfect-powers, factorizations A294068.
A333254 gives run-lengths of differences between consecutive primes.
Second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376596 (prime-power), A376599 (non-prime-power).
Cf. A025475, A045542, A052410, A054819, A064113, A069623, A174965, A216765, A251092, A336416, A336417, A375702.

N:= 10^6: # to use perfect powers <= N
P:= {seq(seq(i^m,i=2..floor(N^(1/m))), m=2 .. ilog2(N))}: nP:= nops(P):
P:= sort(convert(P,list)):
select(i -> 2*P[i] > P[i-1]+P[i+1], [$2..nP-1]); # Robert Israel, Oct 31 2024

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
Join@@Position[Sign[Differences[Select[Range[1000],perpowQ],2]],-1]

A075081 Perfect powers q (A001597) such that (q-1)/2 is prime.

Original entry on oeis.org

27, 2187, 1594323, 7509466514979724803946715958257547, 13915193059764305937984450503671774362956903094027

Offset: 1

Zak Seidov, Oct 16 2002

It can be shown that q must be of the form 3^e with e prime.

The next terms are 3^541, 3^1091, 3^1367, 3^1627, 3^4177, 3^9011, 3^9551, ...

Bo Gyu Jeong, Table of n, a(n) for n = 1..9

Cf. A075079, A076481, A028491.

Extended by Dean Hickerson, Oct 16 2002

A376268 Sorted positions of first appearances in the first differences (A053289) of perfect-powers (A001597).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19, 21, 23, 24, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 67, 69, 70, 71, 72, 73, 74, 76, 77, 78, 79, 80, 81

Offset: 1

Gus Wiseman, Sep 28 2024

nonn

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, ...
with positions of first appearances (A376268):
  1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19, 21, 23, 24, 27, 28, 29, ...

These are the sorted positions of first appearances in A053289 (union A023055).
The complement is A376519.
A053707 lists first differences of consecutive prime-powers.
A333254 lists run-lengths of differences between consecutive primes.
Other families of numbers and their first differences:
For prime numbers (A000040) we have A001223.
For composite numbers (A002808) we have A073783.
For nonprime numbers (A018252) we have A065310.
For perfect powers (A001597) we have A053289.
For non-perfect-powers (A007916) we have A375706.
For squarefree numbers (A005117) we have A076259.
For nonsquarefree numbers (A013929) we have A078147.
For prime-powers inclusive (A000961) we have A057820.
For prime-powers exclusive (A246655) we have A057820(>1).
For non-prime-powers inclusive (A024619) we have A375735.
For non-prime-powers exclusive (A361102) we have A375708.
Cf. A025475, A045542, A052410, A069623, A093555, A174965, A216765, A303707, A305630, A305631, A375736.

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
q=Differences[Select[Range[1000],perpowQ]];
Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

A376519 Positions of terms not appearing for the first time in the first differences (A053289) of perfect-powers (A001597).

Original entry on oeis.org

8, 14, 15, 20, 22, 25, 26, 31, 40, 46, 52, 59, 68, 75, 88, 96, 102, 110, 111, 112, 114, 128, 136, 144, 145, 162, 180, 188, 198, 216, 226, 235, 246, 264, 265, 275, 285, 295, 305, 316, 317, 325, 328, 338, 350, 360, 367, 373, 385, 406, 416, 417, 419, 431, 443

Offset: 1

Gus Wiseman, Sep 28 2024

nonn

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, ...
with positions of latter appearances (A376519):
  8, 14, 15, 20, 22, 25, 26, 31, 40, 46, 52, 59, 68, 75, 88, 96, 102, 110, 111, ...

These are the sorted positions of latter appearances in A053289 (union A023055).
The complement is A376268.
A053707 lists first differences of consecutive prime-powers.
A333254 lists run-lengths of differences between consecutive primes.
Other families of numbers and their first differences:
For prime numbers (A000040) we have A001223.
For composite numbers (A002808) we have A073783.
For nonprime numbers (A018252) we have A065310.
For perfect powers (A001597) we have A053289.
For non-perfect-powers (A007916) we have A375706.
For squarefree numbers (A005117) we have A076259.
For nonsquarefree numbers (A013929) we have A078147.
For prime-powers inclusive (A000961) we have A057820.
For prime-powers exclusive (A246655) we have A057820(>1).
For non-prime-powers inclusive (A024619) we have A375735.
For non-prime-powers exclusive (A361102) we have A375708.
Cf. A025475, A045542, A046933, A052410, A069623, A174965, A216765, A303707, A305630, A305631, A375736.

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
q=Differences[Select[Range[1000],perpowQ]];
Select[Range[Length[q]],MemberQ[Take[q,#-1],q[[#]]]&]

A378368 Positions (in A001597) of consecutive perfect powers with a unique prime between them.

Original entry on oeis.org

15, 20, 22, 295, 1257

Offset: 1

Gus Wiseman, Dec 17 2024

Perfect powers (A001597) are 1 and numbers with a proper integer root.

The perfect powers themselves are given by A001597(a(n)) = A378355(n).

			The 15th and 16th perfect powers are 125 and 128, and 127 is the only prime between them, so 15 is in the sequence.

These are the positions of 1 in A080769.
The next prime after A001597(a(n)) is A178700(n).
For no (instead of one) perfect powers we have A274605.
Swapping 'prime' and 'perfect power' gives A377434, unique case of A377283.
The next perfect power after A001597(a(n)) is A378374(n).
For prime powers instead of perfect powers we have A379155.
A000040 lists the primes, differences A001223.
A001597 lists the perfect powers, differences A053289.
A007916 lists the non perfect powers, differences A375706.
A069623 counts perfect powers <= n.
A076411 counts perfect powers < n.
A081676 gives the greatest perfect power <= n.
A377432 counts perfect powers between primes, see A377436, A377466.
A377468 gives the least perfect power > n.
Cf. A023055, A045542, A046933, A052410, A053607, A067871, A076412, A080101, A375740, A377287.

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
v=Select[Range[1000],perpowQ];
Select[Range[Length[v]-1],Length[Select[Range[v[[#]],v[[#+1]]],PrimeQ]]==1&]

We have A001597(a(n)) = A378355(n) < A178700(n) < A378374(n).

A117934 Perfect powers (A001597) that are close, that is, between consecutive squares.

Original entry on oeis.org

27, 32, 125, 128, 2187, 2197, 6434856, 6436343, 312079600999, 312079650687, 328080401001, 328080696273, 11305786504384, 11305787424768, 62854898176000, 62854912109375, 79723529268319, 79723537443243, 4550858390629024

Offset: 1

T. D. Noe, Apr 03 2006

nonn

It appears that all pairs of close powers involve a cube. For three pairs, the other power is a 7th power. For all remaining pairs, the other power is a 5th power. If this is true, then three powers are never close.
For the first 360 terms, 176 pairs are a cube and a 5th power. The remaining four pairs are a cube and a 7th power. - Donovan Johnson, Feb 26 2011
Loxton proves that the interval [n, n+sqrt(n)] contains at most exp(40 log log n log log log n) powers for n >= 16, and hence there are at most 2*exp(40 log log n log log log n) between consecutive squares in the interval containing n. - Charles R Greathouse IV, Jun 25 2017

			27 and 32 are close because they are between 25 and 36.

Donovan Johnson, Table of n, a(n) for n = 1..360
Daniel J. Bernstein, Detecting perfect powers in essentially linear time, Mathematics of Computation 67 (1998), pp. 1253-1283.
John H. Loxton, Some problems involving powers of integers, Acta Arithmetica 46:2 (1986), pp. 113-123. See Bernstein, Corollary 19.5, for a correction to the proof of Theorem 1.
StackExchange MathOverflow, Are there ever three perfect powers between consecutive squares? Answers by Gjergji Zaimi and Felipe Voloch (2011).

Cf. A097056, A117896 (number of perfect powers between consecutive squares n^2 and (n+1)^2).

Cf. A340696, A340700.

nMax=10^14; lst={}; log2Max=Ceiling[Log[2,nMax]]; bases=Table[2,{log2Max}]; powers=bases^Range[log2Max]; powers[[1]]=Infinity; currPP=1; cnt=0; While[nextPP=Min[powers]; nextPP <= nMax, pos=Flatten[Position[powers,nextPP]]; If[MemberQ[pos,2], cnt=0, cnt++ ]; If[cnt>1, AppendTo[lst,{currPP,nextPP}]]; Do[k=pos[[i]]; bases[[k]]++; powers[[k]]=bases[[k]]^k, {i,Length[pos]}]; currPP=nextPP]; Flatten[lst]

cp's OEIS Frontend

A376560 Points of upward concavity in the sequence of perfect-powers (A001597). Positives of A376559.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A113505 Numbers not the sum of at most three perfect powers (A001597).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A091624 Lesser of consecutive primes whose sum is a perfect power (A001597).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A253642 Number of ways the perfect power A001597(n) can be written as a^b, with a, b > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Python

Formula

A376561 Points of downward concavity in the sequence of perfect-powers (A001597).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A075081 Perfect powers q (A001597) such that (q-1)/2 is prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A376268 Sorted positions of first appearances in the first differences (A053289) of perfect-powers (A001597).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A376519 Positions of terms not appearing for the first time in the first differences (A053289) of perfect-powers (A001597).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A378368 Positions (in A001597) of consecutive perfect powers with a unique prime between them.

Views

Author

Keywords