A057820 -id:A057820 - cp's OEIS frontend

A376267 Run-lengths of first differences (A078147) of nonsquarefree numbers (A013929).

1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 3, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2

Offset: 1

Gus Wiseman, Sep 27 2024

nonn

			The sequence of nonsquarefree numbers (A013929) is:
  4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 50, ...
with first differences (A078147):
  4, 1, 3, 4, 2, 2, 4, 1, 2, 1, 4, 4, 4, 4, 1, 3, 1, 1, 2, 2, 2, 4, 3, 1, ...
with runs:
  (4),(1),(3),(4),(2,2),(4),(1),(2),(1),(4,4,4,4),(1),(3),(1,1),(2,2,2), ...
with lengths (A376267):
  1, 1, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, ...

Robert Israel, Table of n, a(n) for n = 1..10000

For prime instead of nonsquarefree numbers we have A333254.
For run-sums instead of run-lengths we have A376264.
For squarefree instead of nonsquarefree we have A376306.
For prime-powers instead of nonsquarefree numbers we have A376309.
For compression instead of run-lengths we have A376312.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A005117 lists squarefree numbers, differences A076259 (ones A375927).
A013929 lists nonsquarefree numbers, differences A078147.
Cf. A007674, A053797, A053806, A072284, A112925, A120992, A373198, A375707, A376305, A376307, A376311, A380595.

nsf:= remove(numtheory:-issqrfree, [$4..1000]):
S:= nsf[2..-1]-nsf[1..-2]:
R:= NULL: x:= 4: t:= 1:
for i from 2 to nops(S) do
  if S[i] = x then t:= t+1
  else R:= R,t; x:= S[i]; t:= 1
  fi
od:
R; # Robert Israel, Jan 27 2025

Length/@Split[Differences[Select[Range[1000], !SquareFreeQ[#]&]]]//Most

A377702 Perfect-powers except for powers of 2.

Original entry on oeis.org

9, 25, 27, 36, 49, 81, 100, 121, 125, 144, 169, 196, 216, 225, 243, 289, 324, 343, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1000, 1089, 1156, 1225, 1296, 1331, 1369, 1444, 1521, 1600, 1681, 1728, 1764, 1849, 1936, 2025, 2116, 2187, 2197

Offset: 1

Gus Wiseman, Nov 05 2024

nonn

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

			The terms together with their prime indices begin:
     9: {2,2}
    25: {3,3}
    27: {2,2,2}
    36: {1,1,2,2}
    49: {4,4}
    81: {2,2,2,2}
   100: {1,1,3,3}
   121: {5,5}
   125: {3,3,3}
   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}
   289: {7,7}
   324: {1,1,2,2,2,2}

Including the powers of 2 gives A001597, counted by A377435.
For prime-powers we have A061345.
These terms are counted by A377467, for non-perfect-powers A377701.
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.
A188951 counts perfect-powers less than 2^n.
A377468 gives the least perfect-power > n.
Cf. A014210, A014234, A023055, A045542, A052410, A065514, A069623, A246655, A304521, A336416, A345531, A366833.

Select[Range[1000],GCD@@FactorInteger[#][[All,2]]>1&&!IntegerQ[Log[2,#]]&]

from sympy import mobius, integer_nthroot
def A377702(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-2+x+(l:=x.bit_length())+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,l)))
    return bisection(f,n+1,n+1) # Chai Wah Wu, Nov 06 2024

A377780 First differences of A000015 (smallest prime-power >= n).

Original entry on oeis.org

0, 1, 1, 1, 2, 0, 1, 1, 2, 0, 2, 0, 3, 0, 0, 1, 2, 0, 4, 0, 0, 0, 2, 0, 2, 0, 2, 0, 2, 0, 1, 5, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 3, 0, 0, 3, 0, 0, 4, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 2, 0, 2, 0, 6, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Nov 13 2024

nonn

First differences of A000015, restriction to primes A345531.
The opposite is A377782, restriction to primes A377781, differences of A065514.
For squarefree instead of prime-power see A067535, A112925, A112926, A120327.
A000040 lists the primes, differences A001223.
A000961 and A246655 list the prime-powers, differences A057820.
A024619 lists the non-prime-powers, differences A375735, seconds A376599.
A080101 counts prime-powers between primes (exclusive).
A361102 lists the non-powers of primes, differences A375708.
A366833 counts prime-powers between primes.
Cf. A001597, A007916, A007949, A031218, A053289, A053607, A343249, A343250, A377282, A377289, A377468.

Differences[Table[NestWhile[#+1&,n,!PrimePowerQ[#]&],{n,100}]]

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

Gus Wiseman, Nov 26 2024

nonn

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

			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==

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.
Cf. A045542, A052410, A065514, A068361, A076412, A081676, A216765, A345531, A378250, A378253, A378355.

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

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

A378456 Number of composite numbers between consecutive nonprime prime powers (exclusive).

Original entry on oeis.org

1, 0, 4, 5, 1, 2, 12, 11, 12, 31, 3, 1, 32, 59, 11, 25, 46, 13, 125, 14, 80, 88, 94, 103, 52, 261, 35, 267, 147, 172, 120, 9, 9, 163, 355, 279, 313, 207, 329, 347, 376, 108, 257, 805, 283, 262, 25, 917, 242, 1081, 702, 365, 752, 389, 251, 535, 1679, 877, 447

Offset: 1

Gus Wiseman, Nov 30 2024

nonn

The inclusive version is a(n) + 2.

Nonprime prime powers (A246547) begin: 4, 8, 9, 16, 25, 27, 32, 49, ...

			The initial terms count the following composite numbers:
  {6}, {}, {10,12,14,15}, {18,20,21,22,24}, {26}, {28,30}, ...
The composite numbers for a(77) = 6 together with their prime indices are the following. We have also shown the nonprime prime powers before and after:
  32761: {42,42}
  32762: {1,1900}
  32763: {2,19,38}
  32764: {1,1,1028}
  32765: {3,847}
  32766: {1,2,14,31}
  32767: {4,11,36}
  32768: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}

For prime instead of composite we have A067871.
For nonsquarefree numbers we have A378373, for primes A236575.
A000015 gives the least prime-power >= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A002808 lists the composite numbers.
A031218 gives the greatest prime-power <= n.
A046933 counts composite numbers between primes.
A053707 gives first differences of nonprime prime powers.
A080101 = A366833 - 1 counts prime powers between primes.
A246655 lists the prime-powers not including 1, complement A361102.
A345531 gives the nearest prime power after prime(n) + 1, difference A377281.
Cf. A377286, A377287, A377288 (primes A053706).
Cf. A024619, A053607, A065890, A076259, A078147, A243348, A276781, A377057, A377282.

nn=1000;
v=Select[Range[nn],PrimePowerQ[#]&&!PrimeQ[#]&];
Table[Length[Select[Range[v[[i]]+1,v[[i+1]]-1],CompositeQ]],{i,Length[v]-1}]

A376343 Positions of twos in the run-compressed (A037201) first differences (A001223) of the primes (A000040).

Original entry on oeis.org

2, 4, 6, 9, 12, 15, 18, 24, 26, 31, 33, 37, 39, 41, 44, 47, 50, 53, 57, 62, 73, 75, 81, 90, 95, 99, 102, 105, 108, 127, 129, 131, 135, 139, 156, 158, 161, 163, 167, 173, 182, 187, 190, 193, 196, 205, 210, 214, 216, 232, 235, 241, 244, 247, 254, 263, 265, 270

Offset: 1

Gus Wiseman, Sep 26 2024

nonn

We define the run-compression of a sequence to be the anti-run obtained by reducing each run of repeated parts to a single part. Alternatively, we can remove all parts equal to the part immediately to their left. For example, (1,1,2,2,1) has run-compression (1,2,1).

			The sequence of prime numbers (A000040) is:
  2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, ...
with first differences (A001223):
  1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, ...
with run-compression (A037201):
  1, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, ...
with twos at (A376343):
  2, 4, 6, 9, 12, 15, 18, 24, 26, 31, 33, 37, 39, 41, 44, 47, 50, 53, 57, 62, 73, ...

Positions of 2's in A037201.
The repeats were at positions A064113 before being omitted.
A variation for squarefree numbers is A376342.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A005117 lists squarefree numbers, differences A076259 (ones A375927).
A013929 lists nonsquarefree numbers, differences A078147.
A333254 lists run-lengths of differences between consecutive primes.
Cf. A007921, A030173, A053289, A061398, A373817, A373822, A373947, A376305, A376308.

Join@@Position[First/@Split[Differences[Select[Range[100],PrimeQ]]],2]

For just the odd primes we have a(n) - 1.

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

Gus Wiseman, Nov 02 2024

nonn

Non-perfect-powers (A007916) are numbers without a proper integer root.

Positions of terms > 1 appear to be A049579.

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

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.
Cf. A000015, A002808, A024619, A031218, A064113, A065890, A244508, A377282, A377434, A377436, A377466, A377467.

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

a(n) + A377432(n) = A046933(n) = prime(n+1) - prime(n) - 1.

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

Original entry on oeis.org

1, 0, 1, 2, 3, 3, 5, 7, 8, 11, 16, 24, 32, 42, 61, 82, 118, 166, 231, 322, 453, 635, 892, 1253, 1767, 2487, 3505, 4936, 6959, 9816, 13850, 19538, 27578, 38933, 54972, 77641, 109668, 154922, 218879, 309277, 437047, 617658, 872968, 1233896, 1744153, 2465547, 3485478

Offset: 0

Gus Wiseman, Nov 04 2024

nonn

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

Also the number of perfect-powers with n bits.

			The perfect-powers in each prescribed range (rows):
    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
Their binary expansions (columns):
  1  .  100  1000  10000  100000  1000000  10000000  100000000
             1001  11001  100100  1010001  10010000  100100001
                   11011  110001  1100100  10101001  101000100
                                  1111001  11000100  101010111
                                  1111101  11011000  101101001
                                           11100001  110010000
                                           11110011  110111001
                                                     111100100

The union of all numbers counted is A001597, without powers of two A377702.
The version for squarefree numbers is A077643.
These are the first differences of A188951.
The version for prime-powers is A244508.
For primes instead of powers of 2 we have A377432, zeros A377436.
Not counting powers of 2 gives A377467.
The version for non-perfect-powers is A377701.
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.
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, A031218, A045542, A052410, A065514, A069623, A216765, A345531, A377434.

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
Table[Length[Select[Range[2^n,2^(n+1)-1],perpowQ]],{n,0,15}]

from sympy import mobius, integer_nthroot
def A377435(n):
    if n==0: return 1
    def f(x): return int(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 05 2024

For n != 1, a(n) = A377467(n) + 1.

a(26)-a(46) from Chai Wah Wu, Nov 05 2024

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

Gus Wiseman, Nov 05 2024

nonn

Non-perfect-powers (A007916) are numbers without a proper integer root.

Also the number of non-perfect-powers with n bits.

			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

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.

radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
Table[Length[Select[Range[2^n+1, 2^(n+1)-1],radQ]],{n,0,15}]

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

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

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

A378366 Difference between n and the greatest non prime power <= n (allowing 1).

Original entry on oeis.org

0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 0, 1, 0, 0, 1, 2, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Nov 29 2024

nonn

Non prime powers allowing 1 (A361102) are numbers that are not a prime power (A246655), namely 1, 6, 10, 12, 14, 15, 18, 20, 21, 22, 24, ...

Sequences obtained by subtracting each term from n are placed in parentheses below.
For nonprime we almost have A010051 (A179278).
For prime we have A064722 (A007917).
For perfect power we have A069584 (A081676).
For squarefree we have (A070321).
For prime power we have A378457 = A276781-1 (A031218).
For nonsquarefree we have (A378033).
For non perfect power we almost have A075802 (A378363).
Subtracting from n gives (A378367).
The opposite is A378371, adding n A378372.
A000015 gives the least prime power >= n (cf. A378370 = A377282 - 1).
A000040 lists the primes, differences A001223.
A000961 and A246655 list the prime powers, differences A057820.
A024619 and A361102 list the non prime powers, differences A375708 and A375735.
A151800 gives the least prime > n, weak version A007918.
Prime powers between primes: A053607, A080101, A304521, A366833, A377057.
Cf. A007916, A007920, A013632, A065514, A074984, A113646, A345531, A377051, A377054, A377281, A377289, A378357.

Table[n-NestWhile[#-1&,n,PrimePowerQ[#]&],{n,100}]

a(n) = n - A378367(n).

cp's OEIS Frontend

A376267 Run-lengths of first differences (A078147) of nonsquarefree numbers (A013929).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A377702 Perfect-powers except for powers of 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

A377780 First differences of A000015 (smallest prime-power >= n).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A378456 Number of composite numbers between consecutive nonprime prime powers (exclusive).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A376343 Positions of twos in the run-compressed (A037201) first differences (A001223) of the primes (A000040).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

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