cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-20 of 26 results. Next

A378250 Perfect-powers x > 1 such that it is not possible to choose a prime y and a perfect-power z satisfying x > y > z.

Original entry on oeis.org

4, 8, 16, 25, 32, 49, 64, 81, 100, 121, 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, 1849, 1936
Offset: 1

Views

Author

Gus Wiseman, Nov 21 2024

Keywords

Comments

Perfect-powers (A001597) are numbers with a proper integer root, complement A007916.

Examples

			The first number line below shows the perfect-powers. The second shows the primes. The third is a(n).
-1-----4-------8-9------------16----------------25--27--------32------36----
===2=3===5===7======11==13======17==19======23==========29==31==========37==
       4       8              16                25            32
The terms together with their prime indices begin:
     4: {1,1}
     8: {1,1,1}
    16: {1,1,1,1}
    25: {3,3}
    32: {1,1,1,1,1}
    49: {4,4}
    64: {1,1,1,1,1,1}
    81: {2,2,2,2}
   100: {1,1,3,3}
   121: {5,5}
   128: {1,1,1,1,1,1,1}
   144: {1,1,1,1,2,2}
   169: {6,6}
   196: {1,1,4,4}
   216: {1,1,1,2,2,2}
   225: {2,2,3,3}
   243: {2,2,2,2,2}
   256: {1,1,1,1,1,1,1,1}
		

Crossrefs

A version for prime-powers (but starting with prime(k) + 1) is A345531.
The opposite is union of A378035, restriction of A081676.
Union of A378249, run-lengths are A378251.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A001597 lists the perfect-powers, differences A053289, seconds A376559.
A007916 lists the non-perfect-powers, differences A375706, seconds A376562.
A069623 counts perfect-powers <= n.
A076411 counts perfect-powers < n.
A131605 lists perfect-powers that are not prime-powers.
A377432 counts perfect-powers between primes, zeros A377436, positive A377283, postpositive A377466.

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    Union[Table[NestWhile[#+1&,Prime[n],radQ[#]&],{n,100}]]

A378356 Prime index of the next prime after the n-th perfect power.

Original entry on oeis.org

1, 3, 5, 5, 7, 10, 10, 12, 12, 16, 19, 23, 26, 31, 31, 32, 35, 40, 45, 48, 49, 54, 55, 62, 67, 69, 73, 79, 86, 93, 98, 100, 106, 115, 123, 130, 138, 147, 155, 163, 169, 173, 182, 192, 201, 211, 218, 220, 229, 241, 252, 264, 270, 275, 284, 296, 307, 310, 320
Offset: 1

Views

Author

Gus Wiseman, Dec 05 2024

Keywords

Crossrefs

First differences are A080769.
Union is A378365.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
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.
A377432 counts perfect powers between primes, see A377434, A377436, A377466.
A378249 gives the least perfect power > prime(n), restriction of A377468.

Programs

  • Mathematica
    Table[PrimePi[NextPrime[n]],{n,Select[Range[1000],perpowQ]}]

Formula

a(n) = A000720(A001597(n)) + 1.

A378355 Numbers appearing exactly once in A378035 (greatest perfect power < prime(n)).

Original entry on oeis.org

125, 216, 243, 64000, 1295029, 2535525316, 542939080312
Offset: 1

Views

Author

Gus Wiseman, Nov 26 2024

Keywords

Comments

These are perfect-powers p such that the interval from p to the next perfect power contains a unique prime.
Is this sequence infinite? See A178700.

Examples

			We have 125 because 127 is the only prime between 125 and 128.
		

Crossrefs

The next prime is A178700.
Singletons in A378035 (union A378253), restriction of A081676.
The next perfect power is A378374.
Swapping primes and perfect powers gives A379154, unique case of A377283.
A000040 lists the primes, differences A001223.
A001597 lists the perfect powers, differences A053289.
A007916 lists the not perfect powers, differences A375706.
A069623 counts perfect powers <= n.
A076411 counts perfect powers < n.
A377432 counts perfect powers between primes, see A377434, A377436, A377466.
A378249 gives least perfect power > prime(n) (run-lengths A378251), restrict of A377468.

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    y=Table[NestWhile[#-1&,Prime[n],radQ[#]&],{n,1000}];
    Select[Union[y],Count[y,#]==1&]

Formula

A151800(a(n)) = A178700(n).

A379155 Numbers k such that there is a unique prime between the k-th and (k+1)-th prime powers (A246655).

Original entry on oeis.org

2, 3, 5, 7, 9, 10, 13, 15, 17, 18, 22, 23, 26, 27, 31, 32, 40, 42, 43, 44, 52, 53, 67, 68, 69, 70, 77, 78, 85, 86, 90, 91, 116, 117, 119, 120, 135, 136, 151, 152, 169, 170, 186, 187, 197, 198, 243, 244, 246, 247, 291, 292, 312, 313, 339, 340, 358, 360, 362
Offset: 1

Views

Author

Gus Wiseman, Dec 22 2024

Keywords

Comments

Numbers k such that exactly one of A246655(k) and A246655(k+1) is prime. - Robert Israel, Jan 22 2025
The prime powers themselves are: 3, 4, 7, 9, 13, 16, 23, 27, 31, 32, 47, 49, 61, 64, ...

Examples

			The 4th and 5th prime powers are 5 and 7, with interval (5,6,7) containing two primes, so 4 is not in the sequence.
The 13th and 14th prime powers are 23 and 25, with interval (23,24,25) containing only one prime, so 13 is in the sequence.
The 18th and 19th prime powers are 32 and 37, with interval (32,33,34,35,36,37) containing just one prime 37, so 18 is in the sequence.
		

Crossrefs

These are the positions of 1 in A366835, for perfect powers A080769.
For perfect powers instead of prime powers we have A378368.
For no primes we have A379156, for perfect powers A274605.
The prime powers themselves are A379157, for previous A175106.
A000015 gives the least prime power >= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A031218 gives the greatest prime power <= n.
A065514 gives the greatest prime power < prime(n), difference A377289.
A246655 lists the prime powers.
A366833 counts prime powers between primes, see A053607, A304521.

Programs

  • Maple
    N:= 1000: # for terms k where A246655(k+1) <+ N
    P:= select(isprime,[2,seq(i,i=3..N,2)]):
    S:= convert(P,set):
    for p in P while p^2 <= N do
      S:= S union {seq(p^j,j=2..ilog[p](N))}
    od:
    PP:= sort(convert(S,list)):
    state:= 1: Res:= NULL:
    ip:= 2:
    for i from 2 to nops(PP) do
      if PP[i] = P[ip] then
        if state = 0 then Res:= Res,i-1 fi;
        state:= 1;
        ip:= ip+1;
      else
        if state = 1 then Res:= Res,i-1 fi;
        state:= 0;
      fi
    od:
    Res; # Robert Israel, Jan 22 2025
  • Mathematica
    v=Select[Range[100],PrimePowerQ];
    Select[Range[Length[v]-1],Length[Select[Range[v[[#]],v[[#+1]]],PrimeQ]]==1&]

Formula

A246655(a(n)) = A379157(n).

A379157 Prime powers p such that the interval from p to the next prime power contains a unique prime number.

Original entry on oeis.org

3, 4, 7, 9, 13, 16, 23, 27, 31, 32, 47, 49, 61, 64, 79, 81, 113, 125, 127, 128, 167, 169, 241, 243, 251, 256, 283, 289, 337, 343, 359, 361, 509, 512, 523, 529, 619, 625, 727, 729, 839, 841, 953, 961, 1021, 1024, 1327, 1331, 1367, 1369, 1669, 1681, 1847, 1849
Offset: 1

Views

Author

Gus Wiseman, Dec 22 2024

Keywords

Examples

			The next prime power after 32 is 37, with interval (32,33,34,35,36,37) containing just one prime 37, so 32 is in the sequence.
		

Crossrefs

For no primes we have A068315/A379156, for perfect powers A116086/A274605.
The previous instead of next prime power we have A175106.
For perfect powers instead of prime powers we have A378355.
The positions of these prime powers (in A246655) are A379155.
A000015 gives the least prime power >= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A031218 gives the greatest prime power <= n.
A065514 gives the greatest prime power < prime(n), difference A377289.
A246655 lists the prime powers.
A366833 counts prime powers between primes, see A053607, A304521.
A366835 counts primes between prime powers, for perfect powers A080769.

Programs

  • Mathematica
    v=Select[Range[100],PrimePowerQ]
    nextpripow[n_]:=NestWhile[#+1&,n+1,!PrimePowerQ[#]&]
    Select[v,Length[Select[Range[#,nextpripow[#]],PrimeQ]]==1&]

Formula

a(n) = A246655(A379155(n)).

A378253 Perfect powers p such that there are no other perfect powers between p and the least prime > p.

Original entry on oeis.org

1, 4, 9, 16, 27, 36, 49, 64, 81, 100, 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, 1849
Offset: 1

Views

Author

Gus Wiseman, Nov 26 2024

Keywords

Comments

Perfect powers (A001597) are 1 and numbers with a proper integer root, complement A007916.
Each term is the greatest perfect power < prime(k) for some k.

Examples

			The first number line below shows the perfect powers. The second shows each prime. To get a(n), we take the last perfect power in each interval between consecutive primes, omitting the cases where there are none.
-1-----4-------8-9------------16----------------25--27--------32------36----
===2=3===5===7======11==13======17==19======23==========29==31==========37==
		

Crossrefs

Union of A378035, restriction of A081676 to the primes.
The opposite is A378250, union of A378249 (run-lengths A378251).
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.
A080769 counts primes between perfect powers.
A377283 ranks perfect powers between primes, differences A378356.
A377432 counts perfect powers between primes, see A377434, A377436, A377466.

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    Union[Table[NestWhile[#-1&,Prime[n],radQ[#]&],{n,1000}]]

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

Views

Author

Gus Wiseman, Dec 17 2024

Keywords

Comments

Perfect powers (A001597) are 1 and numbers with a proper integer root.
The perfect powers themselves are given by A001597(a(n)) = A378355(n).

Examples

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

Crossrefs

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.

Programs

  • Mathematica
    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&]

Formula

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

A379156 Positions in A246655 (prime powers) of terms q such that there is no prime between q and the next prime power.

Original entry on oeis.org

6, 14, 41, 359, 3589
Offset: 1

Views

Author

Gus Wiseman, Dec 22 2024

Keywords

Comments

The powers of primes themselves are 8, 25, 121, 2187, 32761, ... (A068315).

Crossrefs

The prime powers themselves are A068315, for just one prime A379157.
For perfect powers instead of prime powers we have A274605.
Positions of 0 in A366835.
For just one prime we have A379155, for perfect powers A378368.
A000015 gives the least prime power >= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A031218 gives the greatest prime power <= n.
A065514 gives the greatest prime power < prime(n), difference A377289.
A131605 finds perfect powers that are not prime powers.
A246655 lists the prime powers.
A366833 counts prime powers between primes, see A053607, A304521.

Programs

  • Mathematica
    v=Select[Range[100],PrimePowerQ];
    Select[Range[Length[v]-1],FreeQ[Range[v[[#]],v[[#+1]]],_?PrimeQ]&]

Formula

A246655(a(n)) = A068315(n).

A378365 Next prime index after each perfect power, duplicates removed.

Original entry on oeis.org

1, 3, 5, 7, 10, 12, 16, 19, 23, 26, 31, 32, 35, 40, 45, 48, 49, 54, 55, 62, 67, 69, 73, 79, 86, 93, 98, 100, 106, 115, 123, 130, 138, 147, 155, 163, 169, 173, 182, 192, 201, 211, 218, 220, 229, 241, 252, 264, 270, 275, 284, 296, 307, 310, 320, 328, 330, 343
Offset: 1

Views

Author

Gus Wiseman, Nov 26 2024

Keywords

Comments

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

Examples

			The first number line below shows the perfect powers. The second shows each n at position prime(n). To get a(n), we take the first prime between each pair of consecutive perfect powers, skipping the cases where there are none.
-1-----4-------8-9------------16----------------25--27--------32------36----
===1=2===3===4=======5===6=======7===8=======9==========10==11==========12==
		

Crossrefs

The opposite version is A377283.
Positions of first appearances in A378035.
First differences are A378251.
Union of A378356.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
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.
A080769 counts primes between perfect powers.
A377432 counts perfect powers between primes, see A377434, A377436, A377466.
A378249 gives the least perfect power > prime(n), restriction of A377468.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
    Union[1+Table[PrimePi[n],{n,Select[Range[100],perpowQ]}]]

Formula

These are the distinct elements of the set {1 + A000720(A151800(n)), n>0}.

A377433 Number of non-perfect-powers x in the range prime(n) < x < prime(n+1).

Original entry on oeis.org

0, 0, 1, 1, 1, 2, 1, 3, 3, 1, 3, 3, 1, 3, 4, 5, 1, 4, 3, 1, 5, 2, 5, 7, 2, 1, 3, 1, 3, 11, 2, 5, 1, 8, 1, 5, 5, 3, 4, 5, 1, 9, 1, 2, 1, 11, 10, 2, 1, 3, 5, 1, 8, 4, 5, 5, 1, 5, 3, 1, 8, 13, 3, 1, 3, 12, 5, 8, 1, 3, 5, 6, 5, 5, 3, 5, 7, 2, 7, 9, 1, 9, 1, 5, 2
Offset: 1

Views

Author

Gus Wiseman, Nov 02 2024

Keywords

Comments

Non-perfect-powers (A007916) are numbers without a proper integer root.
Positions of terms > 1 appear to be A049579.

Examples

			Between prime(4) = 7 and prime(5) = 11 the only non-perfect-power is 10, so a(4) = 1.
		

Crossrefs

Positions of 1 are latter terms of A029707.
Positions of terms > 1 appear to be A049579.
For prime-powers instead of non-perfect-powers we have A080101.
For non-prime-powers instead of non-perfect-powers we have A368748.
Perfect-powers in the same range are counted by A377432.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A001597 lists the perfect-powers, differences A053289, seconds A376559.
A007916 lists the non-perfect-powers, differences A375706.
A065514 gives the greatest prime-power < prime(n), difference A377289.
A081676 gives the greatest perfect-power <= n.
A246655 lists the prime-powers not including 1, complement A361102.
A366833 counts prime-powers between primes, see A053706, A053607, A304521, A377286.
A377468 gives the least perfect-power > n.

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    Table[Length[Select[Range[Prime[n]+1, Prime[n+1]-1],radQ]],{n,100}]

Formula

a(n) + A377432(n) = A046933(n) = prime(n+1) - prime(n) - 1.
Previous Showing 11-20 of 26 results. Next