A053806 -id:A053806 - cp's OEIS frontend

A375704 Maximum of the n-th maximal run of adjacent (increasing by one at a time) non-perfect-powers.

3, 7, 15, 24, 26, 31, 35, 48, 63, 80, 99, 120, 124, 127, 143, 168, 195, 215, 224, 242, 255, 288, 323, 342, 360, 399, 440, 483, 511, 528, 575, 624, 675, 728, 783, 840, 899, 960, 999, 1023, 1088, 1155, 1224, 1295, 1330, 1368, 1443, 1520, 1599, 1680, 1727, 1763

Offset: 1

Gus Wiseman, Aug 29 2024

nonn

Non-perfect-powers (A007916) are numbers with no proper integer roots.

Also numbers k > 0 such that k is a perfect power (A001597) but k+1 is not.

			The list of all non-perfect-powers, split into runs, begins:
   2   3
   5   6   7
  10  11  12  13  14  15
  17  18  19  20  21  22  23  24
  26
  28  29  30  31
  33  34  35
  37  38  39  40  41  42  43  44  45  46  47  48
Row n begins with A375703(n), ends with a(n), adds up to A375705(n), and has length A375702(n).

For nonprime numbers: A006093, min A055670, anti-runs A068780, min A005381.
For prime numbers we have A045344.
Inserting 8 after 7 gives A045542.
For nonsquarefree numbers we have A072284(n) + 1, anti-runs A068781.
For squarefree numbers we have A373415, anti-runs A007674.
For prime-powers we have A373674 (min A373673), anti-runs A006549 (A120430).
Non-prime-powers: A373677 (min A373676), anti-runs A255346 (min A373575).
The anti-run version is A375739.
A001597 lists perfect-powers, differences A053289.
A046933 counts composite numbers between primes.
A375736 gives lengths of anti-runs of non-prime-powers, sums A375737.
For runs of non-perfect-powers (A007916):
- length: A375702 = A053289(n+1) - 1
- first: A375703 (same as A216765 with 2 exceptions)
- last: A375704 (this) (same as A045542 with 8 removed)
- sum: A375705
Cf. A053797, A053806, A061398, A061399, A251092, A373408, A375708, A375714.

radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
Max/@Split[Select[Range[100],radQ],#1+1==#2&]//Most
- or -
radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
Select[Range[100],radQ[#]&&!radQ[#+1]&]

For n > 2 we have a(n) = A045542(n+1).

A376307 Run-sums of the sequence of first differences of squarefree numbers.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Sep 21 2024

nonn

			The sequence of squarefree numbers (A005117) is:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, ...
The sequence of first differences (A076259) of squarefree numbers is:
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, ...
with runs:
  (1,1),(2),(1,1),(3),(1),(2),(1,1),(2,2,2),(1,1),(3,3),(1,1),(2),(1,1), ...
with sums A376307 (this sequence).

Run-sums of first differences of A005117.
Before taking run-sums we had A076259, ones A375927.
For the squarefree numbers themselves we have A373413.
For prime instead of squarefree numbers we have A373822, halved A373823.
For compression instead of run-sums we have A376305, ones A376342.
For run-lengths instead of run-sums we have A376306.
For prime-powers instead of squarefree numbers we have A376310.
For positions of first appearances instead of run-sums we have A376311.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A003242 counts compressed or anti-run compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A116861 counts partitions by compressed sum, by compressed length A116608.
A274174 counts contiguous compositions, ranks A374249.
Cf. A007674, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A373197, A373198, A375707.

Total/@Split[Differences[Select[Range[100],SquareFreeQ]]]

A377040 Antidiagonal-sums of absolute value of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).

Original entry on oeis.org

1, 3, 4, 9, 13, 18, 28, 39, 106, 267, 595, 1212, 2286, 4041, 6720, 10497, 15387, 20914, 25894, 29377, 37980, 70785, 175737, 343806, 579751, 861934, 1162080, 1431880, 1688435, 2589533, 8731932, 23911101, 58109574, 130912573, 276067892, 543833014, 992784443

Offset: 0

Gus Wiseman, Oct 18 2024

nonn

			The fourth antidiagonal of A377038 is (6, 1, -1, -2, -3), so a(4) = 13.

The version for primes is A376681, noncomposites A376684, composites A377035.
These are the antidiagonal-sums of the absolute value of A377038.
The non-absolute version is A377039.
For nonsquarefree numbers we have A377048, non-absolute A377047.
For prime-powers we have A377053, non-absolute A377052.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
A377041 gives first column of A377038, for primes A007442 or A030016.
A377042 gives first position of 0 in each row of A377038.
Cf. A007674, A053797, A053806, A061398, A072284, A075526, A076259, A120992, A140119, A376311, A376590, A376591, A377046.

nn=20;
t=Table[Take[Differences[NestList[NestWhile[#+1&,#+1,!SquareFreeQ[#]&]&,1,2*nn],k],nn],{k,0,nn}];
Total/@Table[Abs[t[[j,i-j+1]]],{i,nn},{j,i}]

A378082 Terms appearing only once in A377783 = least nonsquarefree number > prime(n).

Original entry on oeis.org

12, 16, 18, 20, 24, 40, 48, 54, 60, 63, 68, 72, 75, 80, 84, 90, 98, 108, 112, 116, 128, 132, 150, 152, 160, 164, 168, 175, 180, 184, 192, 196, 198, 200, 212, 224, 228, 232, 234, 240, 242, 252, 260, 264, 270, 272, 279, 294, 308, 312, 315, 320, 332, 338, 348

Offset: 1

Gus Wiseman, Nov 20 2024

nonn

Nonsquarefree numbers k such that if p < q are the two greatest primes < k, there is at least one nonsquarefree number between p and q but all numbers between q and k are squarefree. - Robert Israel, Nov 20 2024

			The terms together with their prime indices begin:
   12: {1,1,2}
   16: {1,1,1,1}
   18: {1,2,2}
   20: {1,1,3}
   24: {1,1,1,2}
   40: {1,1,1,3}
   48: {1,1,1,1,2}
   54: {1,2,2,2}
   60: {1,1,2,3}
   63: {2,2,4}
   68: {1,1,7}
   72: {1,1,1,2,2}
   75: {2,3,3}
   80: {1,1,1,1,3}
   84: {1,1,2,4}
   90: {1,2,2,3}
   98: {1,4,4}
  108: {1,1,2,2,2}
  112: {1,1,1,1,4}
  116: {1,1,10}
  128: {1,1,1,1,1,1,1}
  132: {1,1,2,5}

This is a transformation of A377783 (union A378040, differences A377784).
Note also A377783 restricts A120327 (differences A378039) to the primes.
Terms appearing twice are A378083.
Terms not appearing at all are A378084.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147, seconds A376593.
A061398 counts squarefree numbers between primes, zeros A068360.
A061399 counts nonsquarefree numbers between primes, zeros A068361.
A070321 gives the greatest squarefree number up to n.
A071403(n) = A013928(prime(n)) counts squarefree numbers < prime(n).
A378086(n) = A057627(prime(n)) counts nonsquarefree numbers < prime(n).
Cf. A112926 (diffs A378037), opposite A112925 (diffs A378038).
Cf. A378032 (diffs A378034), restriction of A378033 (diffs A378036).
Cf. A053797, A053806, A072284, A112929, A120992, A224363, A337030, A377430, A377431, A377703.

q:= 3: R:= NULL: flag:= false: count:= 0:
while count < 100 do
  p:= q; q:= nextprime(q);
  for k from p+1 to q-1 do
    found:= false;
    if not numtheory:-issqrfree(k) then
      if flag then
          count:= count+1; R:= R,k
      fi;
      found:= true; break
    fi;
   od;
   flag:= found;
od:
R; # Robert Israel, Nov 20 2024

y=Table[NestWhile[#+1&,Prime[n],SquareFreeQ],{n,100}];
Select[Most[Union[y]],Count[y,#]==1&]

A373410 Minimum of the n-th maximal antirun of nonsquarefree numbers differing by more than one.

Original entry on oeis.org

4, 9, 25, 28, 45, 49, 50, 64, 76, 81, 99, 100, 117, 121, 125, 126, 136, 148, 153, 169, 172, 176, 189, 208, 225, 243, 244, 245, 261, 276, 280, 289, 297, 316, 325, 333, 343, 344, 351, 352, 361, 364, 369, 376, 388, 405, 424, 425, 441, 460, 476, 477, 496, 508, 513

Offset: 1

Gus Wiseman, Jun 06 2024

nonn

The maximum is given by A068781.
An antirun of a sequence (in this case A013929) is an interval of positions at which consecutive terms differ by more than one.
Consists of 4 and all nonsquarefree numbers n such that n - 1 is also nonsquarefree.

			Row-minima of:
   4   8
   9  12  16  18  20  24
  25  27
  28  32  36  40  44
  45  48
  49
  50  52  54  56  60  63
  64  68  72  75
  76  80
  81  84  88  90  92  96  98
  99

Gus Wiseman, Four statistics for runs and antiruns of prime, nonprime, squarefree, and nonsquarefree numbers

Functional neighbors: A005381, A006512, A053806, A068781, A373408, A373409, A373412.
A005117 lists the squarefree numbers, first differences A076259.
A013929 lists the nonsquarefree numbers, first differences A078147.
Cf. A049094, A061399, A077641, A077643, A112926, A143658, A294242, A350842, A372683, A372684, A373125.

First/@Split[Select[Range[100],!SquareFreeQ[#]&],#1+1!=#2&]

a(1) = 4; a(n>1) = A068781(n-1) + 1.

A378085 First differences of A070321 (greatest squarefree number <= n).

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Dec 04 2024

nonn

			The greatest squarefree number <= 50 is 47, and the greatest squarefree number <= 51 is 51, so a(51) = 4.

Ones are A007674.
Zeros are A013929 - 1.
Twos are A280892.
Positions of first appearances are A020755 - 1 (except first term).
First-differences of A070321.
The nonsquarefree restriction is A378034, differences of A378032.
For nonsquarefree numbers we have A378036, differences of A378033.
The opposite restriction to primes is A378037, differences of A112926.
The restriction to primes is A378038, differences of A112925.
The nonsquarefree opposite is A378039, restriction A377784.
The opposite version is A378087.
A005117 lists the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147, seconds A376593.
Cf. A013928, A020754, A045882, A053797, A053806, A067535, A068781, A072284, A073247, A073248, A120327.

Differences[Table[NestWhile[#-1&,n,#>1&&!SquareFreeQ[#]&],{n,100}]]

A376592 Points of nonzero curvature in the sequence of squarefree numbers (A005117).

Original entry on oeis.org

2, 3, 5, 6, 7, 8, 10, 13, 15, 17, 19, 20, 22, 23, 25, 26, 28, 29, 30, 31, 34, 36, 37, 38, 39, 41, 42, 44, 45, 46, 47, 49, 50, 51, 52, 54, 57, 59, 60, 61, 63, 64, 66, 67, 69, 70, 72, 73, 74, 75, 76, 77, 78, 80, 81, 82, 83, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95

Offset: 1

Gus Wiseman, Oct 04 2024

nonn

These are points at which the second differences (A376590) are nonzero.

			The squarefree numbers (A005117) are:
  1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 33, 34, ...
with first differences (A076259):
  1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, ...
with first differences (A376590):
  0, 1, -1, 0, 2, -2, 1, -1, 0, 1, 0, 0, -1, 0, 2, 0, -2, 0, 1, -1, 0, 1, -1, 0, 1, ...
with nonzeros at (A376591):
  2, 3, 5, 6, 7, 8, 10, 13, 15, 17, 19, 20, 22, 23, 25, 26, 28, 29, 30, 31, 34, 36, ...

Gus Wiseman, Points of nonzero curvature in the squarefree numbers.

The first differences were A076259, see also A375927, A376305, A376306, A376307, A376311.
These are the nonzeros of A376590.
The complement is A376591.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
For points of nonzero curvature: A333214 (prime), A376603 (composite), A376589 (non-perfect-power), A376595 (nonsquarefree), A376598 (prime-power), A376601 (non-prime-power).
For squarefree numbers: A076259 (first differences), A376590 (second differences), A376591 (inflection and undulation points).
Cf. A007674, A036263, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A333254, A373198, A376655.

Join@@Position[Sign[Differences[Select[Range[100], SquareFreeQ],2]],1|-1]

A377039 Antidiagonal-sums of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).

Original entry on oeis.org

1, 3, 4, 9, 1, 18, 8, -9, 106, -237, 595, -1170, 2276, -3969, 6640, -10219, 14655, -18636, 19666, -12071, -13056, 69157, -171441, 332756, -552099, 798670, -982472, 901528, -116173, -2351795, 8715186, -23856153, 57926066, -130281007, 273804642, -535390274

Offset: 0

Gus Wiseman, Oct 18 2024

sign

These are row-sums of the triangle-version of A377038.

			The fourth antidiagonal of A377038 is (6,1,-1,-2,-3), so a(4) = 1.

The version for primes is A140119, noncomposites A376683, composites A377034.
These are the antidiagonal-sums of A377038.
The absolute version is A377040.
For nonsquarefree numbers we have A377047.
For prime-powers we have A377052.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
A377041 gives first column of A377038, for primes A007442 or A030016.
A377042 gives first position of 0 in each row of A377038.
Cf. A007674, A053797, A053806, A061398, A072284, A075526, A076259, A120992, A376311, A376590, A376591, A377046.

nn=20;
t=Table[Take[Differences[NestList[NestWhile[#+1&,#+1,!SquareFreeQ[#]&]&,1,2*nn],k],nn],{k,0,nn}];
Total/@Table[t[[j,i-j+1]],{i,nn},{j,i}]

A377042 Position of first zero in the n-th differences of the squarefree numbers (A005117), or 0 if it does not appear.

Original entry on oeis.org

0, 0, 1, 11, 8, 57, 14, 11, 13, 1019, 44, 1250, 43, 2721, 42, 249522, 2840, 1989839, 2839, 3373774, 4933, 142715511, 42793, 435650856, 5266, 30119361, 104063, 454172978707, 100285, 434562125244, 2755089, 2409925829164, 2485612

Offset: 0

Gus Wiseman, Oct 18 2024

a(n) for n even appear to be smaller than a(n) for n odd. - Chai Wah Wu, Oct 19 2024

a(33) > 10^13, unless it is 0. - Lucas A. Brown, Nov 15 2024

			The fourth differences begin: -3, 3, 1, -6, 7, -5, 3, 0, -2, ... so a(4) = 8

Lucas A. Brown, Python program.

The version for primes is A376678, noncomposites A376855, composites A377037.
This is the first position of 0 in each row of A377038.
For nonsquarefree numbers we have A377050.
For prime-powers we have A377055.
A000040 lists the primes, differences A001223, seconds A036263.
A005117 lists the squarefree numbers, complement A013929 (differences A078147).
A073576 counts integer partitions into squarefree numbers, factorizations A050320.
A377039 gives antidiagonal-sums of A377038, absolute version A377040.
A377041 gives first column of A377038, for primes A007442 or A030016.
Cf. A007674, A053797, A053806, A061398, A072284, A076259, A112925, A120992, A376311, A376590, A376591, A377046.

nn=10000;
u=Table[Differences[Select[Range[nn],SquareFreeQ],k],{k,2,16}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
m=Table[Position[u[[k]],0][[1,1]],{k,mnrm[Union[First/@Position[u,0]]]}]

a(15)-a(20) from Chai Wah Wu, Oct 19 2024

a(21)-a(32) from Lucas A. Brown, Nov 15 2024

A243348 Difference between the n-th squarefree number and n: a(n) = A005117(n) - n.

Original entry on oeis.org

0, 0, 0, 1, 1, 1, 3, 3, 4, 4, 4, 5, 6, 7, 7, 7, 9, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 16, 16, 19, 20, 21, 22, 22, 22, 23, 23, 25, 25, 25, 26, 26, 26, 27, 27, 29, 29, 29, 31, 31, 32, 32, 32, 33, 34, 35, 35, 35, 36, 39, 39, 39, 40, 40, 40, 41, 41, 41, 42, 42, 42

Offset: 1

Antti Karttunen, Jun 04 2014

nonn

a(n) <= n, as A243351(n) = 2n - A005117(n) goes never negative (please see the plot A005117(n)/n given in the links section).
No runs longer than three appear, because there must be at least one gap (cf. A053806) in each range [4k+1 .. 4(k+1)] where no term(s) of A005117 appear.
See also A120992 which gives the run lengths.
Record values of first differences: a(2) - a(1) = 0, a(4) - a(3) = 1, a(7) - a(6) = 2, a(32) - a(31) = 3, a(151) - a(150) = 4, a(516) - a(515) = 5, a(13392) - a(13391) = 6, a(131965) - a(131964) = 7, a(664314) - a(664313) = 8, a(5392319) - a(5392318) = 9, and a(134453712) - a(134453711) = 11. - Charles R Greathouse IV, Nov 05 2017

Antti Karttunen, Table of n, a(n) for n = 1..10001
Antti Karttunen, Sequence plotted together with A243351 showing how their ratio develops.
Antti Karttunen, Ratio A005117(n)/n plotted in the same way, converging to Pi^2/6.

Cf. A005117, A053797, A053806, A243351, A243289, A243347.

A120992 gives the lengths of runs.

do(x)=my(v=List([0])); forfactored(n=2,x\1, if(vecmax(n[2][,2])==1, listput(v,n[1]-#v-1))); Vec(v) \\ Charles R Greathouse IV, Nov 05 2017

from math import isqrt
from sympy import mobius
def A243348(n):
    def f(x): return n+x-sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1))
    m, k = n, f(n)
    while m != k:
        m, k = k, f(k)
    return m-n # Chai Wah Wu, Aug 12 2024

Scheme
```
(define (A243348 n) (- (A005117 n) n))
```

a(n) = A005117(n) - n.
a(n) = A243349(n) - A243289(n).
a(n) = n - A243351(n).
Limit_{n->oo} a(n)/A243351(n) = (Pi^2 - 6)/(12 - Pi^2) = 1.81637833.... - Charles R Greathouse IV, Jun 04 2014
a(n) ~ kn where k = Pi^2/6 - 1 = 0.644934.... - Charles R Greathouse IV, Nov 05 2017

cp's OEIS Frontend

A375704 Maximum of the n-th maximal run of adjacent (increasing by one at a time) non-perfect-powers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376307 Run-sums of the sequence of first differences of squarefree numbers.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A377040 Antidiagonal-sums of absolute value of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A378082 Terms appearing only once in A377783 = least nonsquarefree number > prime(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Mathematica

A373410 Minimum of the n-th maximal antirun of nonsquarefree numbers differing by more than one.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A378085 First differences of A070321 (greatest squarefree number <= n).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A376592 Points of nonzero curvature in the sequence of squarefree numbers (A005117).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A377039 Antidiagonal-sums of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A377042 Position of first zero in the n-th differences of the squarefree numbers (A005117), or 0 if it does not appear.

Views

Author

Keywords

Comments