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 51-59 of 59 results.

A377701 Number of non-perfect-powers x in the range 2^n < x < 2^(n+1).

Original entry on oeis.org

0, 1, 3, 6, 13, 29, 59, 121, 248, 501, 1008, 2024, 4064, 8150, 16323, 32686, 65418, 130906, 261913, 523966, 1048123, 2096517, 4193412, 8387355, 16775449, 33551945, 67105359, 134212792, 268428497, 536861096, 1073727974, 2147464110, 4294939718, 8589895659
Offset: 0

Views

Author

Gus Wiseman, Nov 05 2024

Keywords

Comments

Non-perfect-powers (A007916) are numbers without a proper integer root.
Also the number of non-perfect-powers with n bits.

Examples

			The non-perfect-powers in each range (rows):
   .
   3
   5  6  7
  10 11 12 13 14 15
  17 18 19 20 21 22 23 24 26 28 29 30 31
Their binary expansions (columns):
  .  11  101  1010  10001
         110  1011  10010
         111  1100  10011
              1101  10100
              1110  10101
              1111  10110
                    10111
                    11000
                    11010
                    11100
                    11101
                    11110
                    11111

Crossrefs

The union of all numbers counted is A007916.
For squarefree numbers we have A077643.
For prime-powers we have A244508.
For primes instead of powers of 2 we have A377433, ones A029707.
For perfect-powers we have A377467, for primes A377432, zeros A377436.
A000225(n) counts the interval from A000051(n) to A000225(n+1).
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.
A081676 gives the greatest perfect-power <= n.
A131605 lists perfect-powers that are not prime-powers.
A377468 gives the least perfect-power > n.
Cf. A000015, A013597, A014210, A014234, A023055, A045542, A052410, A061398, A304521, A377434, A377435, A377702.

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
Table[Length[Select[Range[2^n+1, 2^(n+1)-1],radQ]],{n,0,15}]
  • Python
    from sympy import mobius, integer_nthroot
def A377701(n):
    def f(x): return int(x-1+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
    return f((1<Chai Wah Wu, Nov 06 2024

Formula

a(n) = 2^n-1-A377467(n). - Pontus von Brömssen, Nov 06 2024

Extensions

Offset corrected by, and a(16)-a(33) from Pontus von Brömssen, Nov 06 2024

A378364 Prime numbers such that the interval from the previous prime number contains a unique perfect power.

Original entry on oeis.org

2, 5, 17, 53, 67, 83, 101, 131, 149, 173, 197, 223, 227, 251, 257, 293, 331, 347, 367, 401, 443, 487, 521, 541, 577, 631, 677, 733, 787, 853, 907, 967, 1009, 1031, 1091, 1163, 1229, 1297, 1361, 1373, 1447, 1523, 1601, 1693, 1733, 1777, 1861, 1949, 2027, 2053
Offset: 1

Views

Author

Gus Wiseman, Dec 16 2024

Keywords

Comments

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

Examples

			The prime before 17 is 13, and the interval (13,14,15,16,17) contains only one perfect power 16, so 17 is in the sequence.
The prime before 29 is 23, and the interval (23,24,25,26,27,28,29) contains two perfect powers 25 and 27, so 29 is not in the sequence.

Crossrefs

For non prime powers we have A006512.
For zero instead of one perfect power we have the prime terms of A345531.
The indices of these primes are the positions of 1 in A377432.
The indices of these primes are 1 + A377434(n-1).
For more than one perfect power see A377466.
Swapping "prime" with "perfect power" gives A378374.
For next instead of previous prime we have A379154.
A000040 lists the primes, differences A001223.
A001597 lists the perfect powers, differences A053289.
A007916 lists the non perfect powers, differences A375706.
A081676 gives the greatest perfect power <= n.
A377468 gives the least perfect power > n.
Cf. A023055, A045542, A052410, A053607, A069623, A376560, A377287, A377436.

Programs

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

A379154 Prime numbers p such that the interval from p to the next prime number contains a unique perfect power.

Original entry on oeis.org

3, 13, 47, 61, 79, 97, 127, 139, 167, 193, 211, 223, 241, 251, 283, 317, 337, 359, 397, 439, 479, 509, 523, 571, 619, 673, 727, 773, 839, 887, 953, 997, 1021, 1087, 1153, 1223, 1291, 1327, 1367, 1439, 1511, 1597, 1669, 1723, 1759, 1847, 1933, 2017, 2039, 2113
Offset: 1

Views

Author

Gus Wiseman, Dec 18 2024

Keywords

Comments

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

Examples

			The prime after 13 is 17, and the interval (13,14,15,16,17) contains only one perfect power 16, so 13 is in the sequence.

Links

Crossrefs

The indices of these primes are one plus the positions of 1 in A377432.
For zero instead of one perfect power we have the primes indexed by A377436.
The indices of these primes are A377434.
Swapping "prime" with "perfect power" gives A378355, indices A378368.
For previous instead of next prime we have A378364.
A000040 lists the primes, differences A001223.
A001597 lists the perfect powers, differences A053289.
A007916 lists the non perfect powers, differences A375706.
A081676 gives the greatest perfect power <= n.
A116086 gives perfect powers with no primes between them and the next perfect power.
A366833 counts prime powers between primes, see A053607, A304521.
A377468 gives the least perfect power > n.
Cf. A023055, A045542, A052410, A069623, A376560, A377283, A377287, A377466, A378374.

Programs

  • Maple
    N:= 10^4: # to get all entries <= N
S:={seq(seq(a^b, b = 2 .. floor(log[a](N))), a = 2 .. floor(sqrt(N)))}:
S:= sort(convert(S,list)):
J:= select(i -> nextprime(S[i]) < S[i+1] and prevprime(S[i]) > S[i-1], [$2..nops(S)-1]):
J:= [1,op(J)]:
map(prevprime, S[J]); # Robert Israel, Jan 19 2025
  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
Select[Range[1000],PrimeQ[#]&&Length[Select[Range[#,NextPrime[#]],perpowQ]]==1&]
  • PARI
    is_a379154(n) = isprime(n) && #select(x->ispower(x), [n+1..nextprime(n+1)-1])==1 \\ Hugo Pfoertner, Dec 19 2024

Formula

a(n) = A151799(A378364(n+1)).

A375928 Positions of adjacent non-prime-powers (exclusive) differing by more than 1.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 10, 11, 12, 13, 14, 18, 21, 22, 25, 26, 29, 34, 35, 37, 39, 42, 43, 48, 49, 50, 55, 62, 65, 66, 69, 70, 73, 80, 83, 84, 86, 91, 92, 101, 102, 107, 112, 115, 116, 119, 124, 125, 134, 135, 138, 139, 150, 161, 164, 165, 168, 173, 174, 175, 182
Offset: 1

Views

Author

Gus Wiseman, Sep 12 2024

Keywords

Examples

			The non-prime-powers (exclusive) are 1, 6, 10, 12, 14, 15, 18, 20, ... which increase by more than 1 after positions 1, 2, 3, 4, 6, 7, ...

Crossrefs

For prime-powers inclusive (A000961) we have A376163, differences A373672.
For nonprime numbers (A002808) we have A014689, differences A046933.
First differences are A110969.
The complement is A375713.
For non-perfect-powers we have A375714, complement A375740.
The complement for prime-powers (exclusive) is A375734, differences A373671.
The complement for nonprime numbers is A375926, differences A373403.
A000040 lists the prime numbers, differences A001223.
A000961 lists prime-powers (inclusive), differences A057820.
A007916 lists non-perfect-powers, differences A375706.
A024619 lists non-prime-powers (inclusive), differences A375735.
A246655 lists prime-powers (exclusive), differences A174965.
A361102 lists non-prime-powers (exclusive), differences A375708.
Cf. A006549, A053289, A073783, A093555, A120430, A176246, A251092.

Programs

  • Mathematica
    ce=Select[Range[100],!PrimePowerQ[#]&];
Select[Range[Length[ce]-1],!ce[[#+1]]==ce[[#]]+1&]

Formula

The inclusive version is a(n+1) - 1.

A377043 The n-th perfect-power A001597(n) minus the n-th power of a prime A000961(n).

Original entry on oeis.org

0, 2, 5, 5, 11, 18, 19, 23, 25, 36, 48, 64, 81, 98, 100, 101, 115, 138, 164, 179, 184, 200, 209, 240, 271, 284, 300, 336, 374, 413, 439, 450, 495, 542, 587, 632, 683, 738, 793, 852, 887, 903, 964, 1029, 1097, 1165, 1194, 1230, 1295, 1370, 1443, 1518, 1561
Offset: 1

Views

Author

Gus Wiseman, Oct 25 2024

Keywords

Comments

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

Crossrefs

Excluding 1 from the powers of primes gives A377044.
A000015 gives the least prime-power >= n.
A031218 gives the greatest prime-power <= n.
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.
A024619 lists the non-prime-powers, differences A375735, seconds A376599.
A025475 lists numbers that are both a perfect-power and a prime-power.
A080101 counts prime-powers between primes (exclusive).
A106543 lists numbers that are neither a perfect-power nor a prime-power.
A131605 lists perfect-powers that are not prime-powers.
A246655 lists the prime-powers, complement A361102 (differences A375708).
Prime-power runs: A373675, min A373673, max A373674, length A174965.
Prime-power antiruns: A373576, min A120430, max A006549, length A373671.
Cf. A023055, A045542, A052410, A053707, A069623, A110969, A216765, A377051.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
per=Select[Range[1000],perpowQ];
per-NestList[NestWhile[#+1&,#+1,!PrimePowerQ[#]&]&,1,Length[per]-1]
  • Python
    from sympy import mobius, primepi, integer_nthroot
def A377043(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return int(n-1+x+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
    def g(x): return int(n-1+x-sum(primepi(integer_nthroot(x,k)[0]) for k in range(1,x.bit_length())))
    return bisection(f,n,n)-bisection(g,n,n) # Chai Wah Wu, Oct 27 2024

Formula

a(n) = A001597(n) - A000961(n).

A377044 The n-th perfect-power A001597(n) minus the n-th prime-power A246655(n).

Original entry on oeis.org

-1, 1, 4, 4, 9, 17, 18, 21, 23, 33, 47, 62, 77, 96, 98, 99, 113, 137, 159, 175, 182, 196, 207, 236, 265, 282, 297, 333, 370, 411, 433, 448, 493, 536, 579, 628, 681, 734, 791, 848, 879, 899, 962, 1028, 1094, 1159, 1192, 1220, 1293, 1364, 1437, 1514, 1559, 1591
Offset: 1

Views

Author

Gus Wiseman, Oct 25 2024

Keywords

Comments

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

Crossrefs

Including 1 with the prime-powers gives A377043.
A000015 gives the least prime-power >= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820, A093555, A376596.
A001597 lists the perfect-powers, differences A053289, seconds A376559.
A007916 lists the non-perfect-powers, differences A375706, seconds A376562.
A024619 lists the non-prime-powers, differences A375735, seconds A376599.
A025475 lists numbers that are both a perfect-power and a prime-power.
A031218 gives the greatest prime-power <= n.
A080101 counts prime-powers between primes (exclusive).
A106543 lists numbers that are neither a perfect-power nor a prime-power.
A131605 lists perfect-powers that are not prime-powers.
A246655 lists the prime-powers, complement A361102, A375708.
Prime-power runs: A373675, min A373673, max A373674, length A174965.
Prime-power antiruns: A373576, min A120430, max A006549, length A373671.
Cf. A023055, A045542, A052410, A053707, A069623, A110969, A216765, A376560, A376561, A377051.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
per=Select[Range[1000],perpowQ];
per-NestList[NestWhile[#+1&, #+1,!PrimePowerQ[#]&]&,2,Length[per]-1]
  • Python
    from sympy import mobius, primepi, integer_nthroot
def A377044(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return int(n-1+x+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
    def g(x): return int(n+x-sum(primepi(integer_nthroot(x,k)[0]) for k in range(1,x.bit_length())))
    return bisection(f,n,n)-bisection(g,n,n) # Chai Wah Wu, Oct 27 2024

Formula

a(n) = A001597(n) - A246655(n).

A378614 Number of composite numbers (A002808) between consecutive perfect powers (A001597), exclusive.

Original entry on oeis.org

0, 1, 0, 4, 5, 1, 2, 3, 8, 11, 12, 15, 15, 3, 1, 12, 19, 21, 16, 7, 12, 11, 25, 29, 16, 13, 32, 33, 35, 22, 14, 40, 39, 42, 45, 46, 47, 50, 52, 32, 19, 55, 56, 59, 60, 27, 35, 65, 64, 67, 68, 40, 30, 75, 74, 77, 19, 57, 62, 9, 9, 81, 81, 88, 89, 87, 32, 55, 94
Offset: 1

Views

Author

Gus Wiseman, Dec 02 2024

Keywords

Comments

The inclusive version is a(n) + 2.

Examples

			The composite numbers counted by a(n) cover A106543 with the following disjoint sets:
  .
  6
  .
  10 12 14 15
  18 20 21 22 24
  26
  28 30
  33 34 35
  38 39 40 42 44 45 46 48
  50 51 52 54 55 56 57 58 60 62 63

Links

Crossrefs

For prime instead of perfect power we have A046933.
For prime instead of composite we have A080769.
For nonsquarefree instead of perfect power we have A378373, for primes A236575.
For nonprime prime power instead of perfect power we have A378456.
A001597 lists the perfect powers, differences A053289.
A002808 lists the composite numbers.
A007916 lists the non perfect powers, differences A375706.
A069623 counts perfect powers <= n.
A076411 counts perfect powers < n.
A106543 lists the composite non perfect powers.
A377432 counts perfect powers between primes, see A377434, A377436, A377466.
A378365 gives the least prime > each perfect power, opposite A377283.
Cf. A045542, A052410, A065890, A076412, A081676, A216765, A276781, A377057, A377468, A378035, A378251.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
v=Select[Range[100],perpowQ[#]&];
Table[Length[Select[Range[v[[i]]+1,v[[i+1]]-1],CompositeQ]],{i,Length[v]-1}]
  • Python
    from sympy import mobius, integer_nthroot, primepi
def A378614(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return int(n+x-1+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
    return -(a:=bisection(f,n,n))+(b:=bisection(lambda x:f(x)+1,a+1,a+1))-primepi(b)+primepi(a)-1 # Chai Wah Wu, Dec 03 2024

A376163 Positions of adjacent non-prime-powers (inclusive, so 1 is a prime-power) differing by 1.

Original entry on oeis.org

4, 7, 8, 14, 15, 16, 18, 19, 22, 23, 26, 27, 29, 30, 31, 32, 35, 37, 39, 40, 43, 44, 45, 46, 50, 51, 52, 53, 55, 56, 57, 58, 59, 60, 62, 63, 66, 67, 70, 71, 73, 74, 75, 76, 77, 78, 80, 81, 84, 86, 87, 88, 89, 92, 93, 94, 95, 96, 97, 98, 99, 102, 103, 104, 105
Offset: 1

Views

Author

Gus Wiseman, Sep 13 2024

Keywords

Examples

			The non-prime-powers (inclusive) are 6, 10, 12, 14, 15, 18, 20, 21, 22, 24, ... which increase by 1 after positions 4, 7, 8, ...

Crossrefs

For prime-powers inclusive (A000961) we have A375734, differences A373671.
For nonprime numbers (A002808) we have A375926, differences A373403.
For prime-powers exclusive (A246655) we have A375734(n+1) + 1.
First differences are A373672.
The exclusive version is a(n) - 1 = A375713.
Positions of 1's in A375735.
For non-perfect-powers we have A375740.
Prime-powers inclusive:
- terms: A000961
- differences: A057820
- runs: A373675, A373673, A373674, A174965
- antiruns: A373576, A120430, A006549, A373671
Non-prime-powers inclusive:
- terms: A361102
- differences: A375708
- runs: A373678, A373676, A373677, A110969
- antiruns: A373679, A373575, A255346, A373672
A000040 lists all of the primes, differences A001223.
A007916 lists non-perfect-powers, differences A375706.
Cf. A046933, A053289, A073783, A093555, A176246, A251092, A375714.

Programs

  • Mathematica
    ce=Select[Range[2,100],!PrimePowerQ[#]&];
Select[Range[Length[ce]-1],ce[[#+1]]==ce[[#]]+1&]

A378617 First differences of A378249 (next perfect power after prime(n)).

Original entry on oeis.org

0, 4, 0, 8, 0, 9, 0, 0, 7, 0, 17, 0, 0, 0, 15, 0, 0, 17, 0, 0, 0, 19, 0, 0, 21, 0, 0, 0, 0, 7, 16, 0, 0, 25, 0, 0, 0, 0, 27, 0, 0, 0, 0, 20, 0, 0, 9, 18, 0, 0, 0, 0, 13, 33, 0, 0, 0, 0, 0, 0, 35, 0, 0, 0, 0, 19, 0, 18, 0, 0, 0, 39, 0, 0, 0, 0, 0, 41, 0, 0, 0
Offset: 1

Views

Author

Gus Wiseman, Dec 09 2024

Keywords

Comments

This is the next perfect power after prime(n+1), minus the next perfect power after prime(n).
Perfect powers (A001597) are 1 and numbers with a proper integer root, complement A007916.

Crossrefs

Positions of positives are A377283.
Positions of zeros are A377436.
The restriction to primes has first differences A377468.
A version for nonsquarefree numbers is A377784, differences of A377783.
The opposite is differences of A378035 (restriction of A081676).
First differences of A378249, run-lengths A378251.
Without zeros we have differences of A378250.
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.
A377432 counts perfect powers between primes.
A378356 - 1 gives next prime after perfect powers, union A378365 - 1.
Cf. A000015, A007918, A023055, A045542, A052410, A065514, A076412, A188951, A216765, A377431, A377434.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
Table[NestWhile[#+1&,Prime[n],Not@*perpowQ],{n,100}]//Differences
Previous Showing 51-59 of 59 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.