A064113 -id:A064113 - cp's OEIS frontend

A333230 Positions of weak ascents in the sequence of differences between primes.

1, 2, 3, 5, 7, 8, 10, 13, 14, 15, 17, 20, 22, 23, 26, 28, 29, 31, 33, 35, 36, 38, 39, 41, 43, 45, 46, 49, 50, 52, 54, 55, 57, 60, 61, 64, 65, 67, 69, 70, 71, 73, 75, 76, 78, 79, 81, 83, 85, 86, 89, 90, 93, 95, 96, 98, 100, 102, 104, 105, 107, 109, 110, 113

Offset: 1

Gus Wiseman, Mar 18 2020

Partial sums of A333252.

			The prime gaps split into the following strictly decreasing subsequences: (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), ...

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Thomas Bloom, Let d_n = p_(n+1)-p_n. The set of n such that d_(n+1) >= d_n has density 1/2, and similarly for d_(n+1) <= d_n. Furthermore, there are infinitely many n such that d_(n+1) = d_n, Erdős Problems.
Terence Tao, Erdős problem database, see no. 218.

The version for the Kolakoski sequence is A022297.
The version for equal differences is A064113.
The version for strict ascents is A258025.
The version for strict descents is A258026.
The version for distinct differences is A333214.
The version for weak descents is A333231.
First differences are A333252 (if the first term is 0).
Prime gaps are A001223.
Weakly decreasing runs of standard compositions are counted by A124765.
Weakly increasing runs of standard compositions are counted by A124766.
Strictly increasing runs of standard compositions are counted by A124768.
Strictly decreasing runs of standard compositions are counted by A124769.
Runs of prime gaps with nonzero differences are A333216.
Cf. A000040, A000720, A036263, A054819, A084758, A333212, A333213, A333215.

Accumulate[Length/@Split[Differences[Array[Prime,100]],#1>#2&]]//Most
(* or *)
Select[Range[100],Prime[#+1]-Prime[#]<=Prime[#+2]-Prime[#+1]&]

Numbers k such that prime(k+2) - 2*prime(k+1) + prime(k) >= 0.

A333216 Lengths of maximal subsequences without adjacent equal terms in the sequence of prime gaps.

Original entry on oeis.org

2, 13, 21, 3, 7, 8, 1, 18, 29, 5, 3, 8, 11, 31, 4, 20, 3, 7, 5, 19, 21, 32, 1, 19, 48, 19, 29, 32, 7, 38, 1, 43, 12, 33, 46, 6, 16, 8, 4, 34, 15, 1, 19, 7, 1, 23, 28, 30, 22, 8, 1, 7, 1, 52, 14, 56, 10, 26, 2, 30, 65, 5, 71, 12, 44, 39, 37, 6, 19, 47, 11, 10

Offset: 1

Gus Wiseman, Mar 15 2020

Prime gaps are differences between adjacent prime numbers.

Essentially the same as A145024. - R. J. Mathar, Mar 16 2020

			The prime gaps split into the following subsequences without adjacent equal terms: (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,2,4,14,4,6,2,10,2,6), (6,4,6), (6,2,10,2,4,2,12), (12,4,2,4,6,2,10,6), ...

First differences of A064113.
The version for the Kolakoski sequence is A306323.
The weakly decreasing version is A333212.
The weakly increasing version is A333215.
The strictly decreasing version is A333252.
The strictly increasing version is A333253.
The equal version is A333254.
Cf. A000040, A001223, A084758, A106356, A124762, A124767, A333214.

Length/@Split[Differences[Array[Prime,100]],UnsameQ]//Most

Ones correspond to balanced prime quartets (A054800), so the sum of terms up to but not including the n-th one is A000720(A054800(n - 1)) = A090832(n).

A376591 Inflection and undulation points in the sequence of squarefree numbers (A005117).

Original entry on oeis.org

1, 4, 9, 11, 12, 14, 16, 18, 21, 24, 27, 32, 33, 35, 40, 43, 48, 53, 55, 56, 58, 62, 65, 68, 71, 79, 84, 87, 96, 98, 99, 101, 103, 107, 110, 113, 118, 120, 121, 123, 128, 131, 134, 137, 142, 144, 145, 147, 152, 153, 155, 158, 163, 165, 166, 172, 175, 179, 184

Offset: 1

Gus Wiseman, Oct 04 2024

nonn

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

			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 zeros at (A376591):
 1, 4, 9, 11, 12, 14, 16, 18, 21, 24, 27, 32, 33, 35, 40, 43, 48, 53, 55, 56, 58, ...

Gus Wiseman, Inflection and undulation points in the squarefree numbers.

The first differences were A076259, see also A375927, A376305, A376306, A376307, A376311.
These are the zeros of A376590.
The complement is A376592.
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 inflections and undulations: A064113 (prime), A376602 (composite), A376588 (non-perfect-power), A376594 (nonsquarefree), A376597 (prime-power), A376600 (non-prime-power).
For squarefree numbers: A076259 (first differences), A376590 (second differences), A376592 (nonzero curvature).
Cf. A007674, A036263, A053797, A053806, A061398, A072284, A112925, A112926, A120992, A333254, A376593, A376655.

Join@@Position[Differences[Select[Range[100],SquareFreeQ],2],0]

A376602 Inflection and undulation points in the sequence of composite numbers (A002808).

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 14, 15, 16, 18, 20, 21, 22, 25, 27, 29, 32, 33, 34, 37, 38, 39, 41, 43, 44, 45, 48, 50, 52, 53, 54, 57, 60, 61, 62, 65, 66, 67, 68, 69, 72, 74, 76, 78, 80, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 96, 99, 100, 101, 103, 105, 106, 107, 108

Offset: 1

Gus Wiseman, Oct 05 2024

nonn

These are points at which the second differences (A073445) are zero.

			The composite numbers (A002808) are:
  4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, ...
with first differences (A073783):
  2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, ...
with first differences (A073445):
  0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, ...
with zeros at (A376602):
  1, 3, 5, 7, 9, 11, 14, 15, 16, 18, 20, 21, 22, 25, 27, 29, 32, 33, 34, 37, 38, ...

Wikipedia, Inflection point
Gus Wiseman, Inflection and undulation points in the sequence of composite numbers.

Partitions into composite numbers are counted by A023895, factorizations A050370.
For prime instead of composite we have A064113.
These are the positions of zeros in A073445.
For first differences we had A073783, ones A375929, complement A065890.
For concavity in primes we have A258025/A258026, weak A333230/A333231.
For upward concavity (instead of zero) we have A376651, downward A376652.
The complement is A376603.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376603 (nonzero curvature), A376651 (concave-up), A376652 (concave-down).
For inflection and undulation points: A064113 (prime), A376588 (non-perfect-power), A376591 (squarefree), A376594 (nonsquarefree), A376597 (prime-power), A376600 (non-prime-power).
Cf. A000040, A036263, A251092, A333214, A333216, A333254.

Join@@Position[Differences[Select[Range[100],CompositeQ],2],0]

A333215 Lengths of maximal weakly increasing subsequences in the sequence of prime gaps (A001223).

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 14 2020

nonn

Prime gaps are differences between adjacent prime numbers.

			The prime gaps split into the following weakly increasing subsequences: (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), (2,4,14), ...

Prime gaps are A001223.
Ones correspond to strong prime quartets A054804.
Weakly increasing runs of compositions in standard order are A124766.
First differences of A258026 (with zero prepended).
The version for the Kolakoski sequence is A332875.
The weakly decreasing version is A333212.
The unequal version is A333216.
Positions of weak ascents in prime gaps are A333230.
The strictly decreasing version is A333252.
The strictly increasing version is A333253.
The equal version is A333254.
Cf. A000040, A000720, A036263, A054819, A064113, A084758, A124765, A124768, A258025, A333213, A333214.

Length/@Split[Differences[Array[Prime,100]],#1<=#2&]//Most

Ones correspond to strong prime quartets (A054804), so the sum of terms up to but not including the n-th one is A000720(A054804(n - 1)).

A376683 Antidiagonal-sums of the array A376682(n,k) = n-th term of the k-th differences of the noncomposite numbers (A008578).

Original entry on oeis.org

1, 3, 4, 9, 6, 27, -20, 109, -182, 471, -868, 1737, -2872, 4345, -4700, 1133, 14060, -55275, 150462, -346093, 717040, -1369351, 2432872, -4002905, 5964846, -7524917, 6123130, 4900199, -40900410, 134309057, -348584552, 798958881, -1678213106, 3277459119

Offset: 0

Gus Wiseman, Oct 15 2024

sign

			The fourth anti-diagonal of A376682 is: (7, 2, 0, -1, -2), so a(4) = 6.

The modern version (for A000040 instead of A008578) is A140119.
The absolute version is A376681.
Antidiagonal-sums of A376682 (modern version A095195).
For composite instead of noncomposite we have A377033.
For squarefree instead of noncomposite we have A377038, nonsquarefree A377046.
A000040 lists the modern primes, differences A001223, second A036263.
A008578 lists the noncomposites, first differences A075526.
Cf. A007442, A030016, A064113, A065890, A002808, A173390, A233671, A333214, A333254, A376678, A376684, A376855.

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

A377037 Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.

Original entry on oeis.org

1, 14, 2, 65, 1, 83, 2, 7, 1, 83, 2, 424, 12, 32, 11, 733, 10, 940, 9, 1110, 8, 1110, 7, 1110, 6, 1110, 112, 1110, 111, 1110, 110, 2192, 109, 13852, 108, 13852, 107, 13852, 106, 13852, 105, 17384, 104, 17384, 103, 17384, 102, 17384, 101, 27144, 552, 28012, 551

Offset: 2

Gus Wiseman, Oct 17 2024

nonn

			The third differences of the composite numbers are:
  -1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, -2, 1, 0, 0, 1, -1, -1, ...
so a(3) = 14.

Alois P. Heinz, Table of n, a(n) for n = 2..100

The version for prime instead of composite is A376678.
For noncomposite numbers we have A376855.
This is the first position of 0 in row n of the array A377033.
For squarefree instead of composite we have A377042, nonsquarefree A377050.
For prime-power instead of composite we have A377055.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, second A036263.
A002808 lists the composite numbers, differences A073783, second A073445.
A008578 lists the noncomposites, differences A075526.
A377036 gives first term of the n-th differences of the composite numbers, for primes A007442 or A030016.
Cf. A018252, A064113, A065310, A065890, A140119, A173390, A233671, A258025, A258026, A350004, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680, A377034, A377035.

nn=10000;
u=Table[Differences[Select[Range[nn],CompositeQ],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]]]}]

Offset 2 from Michel Marcus, Oct 18 2024

a(17)-a(54) from Alois P. Heinz, Oct 18 2024

A333231 Positions of weak descents in the sequence of differences between primes.

Original entry on oeis.org

2, 4, 6, 9, 11, 12, 15, 16, 18, 19, 21, 24, 25, 27, 30, 32, 34, 36, 37, 39, 40, 42, 44, 46, 47, 48, 51, 53, 54, 55, 56, 58, 59, 62, 63, 66, 68, 72, 73, 74, 77, 80, 82, 84, 87, 88, 91, 92, 94, 97, 99, 101, 102, 103, 106, 107, 108, 110, 111, 112, 114, 115, 118

Offset: 1

Gus Wiseman, Mar 18 2020

Partial sums of A333253.

			The prime gaps split into the following strictly increasing subsequences: (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), (2,4,14), ...

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Thomas Bloom, Let d_n = p_(n+1)-p_n. The set of n such that d_(n+1) >= d_n has density 1/2, and similarly for d_(n+1) <= d_n. Furthermore, there are infinitely many n such that d_(n+1) = d_n, Erdős Problems.
Terence Tao, Erdős problem database, see no. 218.

The version for the Kolakoski sequence is A025505.
The version for equal differences is A064113.
The version for strict ascents is A258025.
The version for strict descents is A258026.
The version for distinct differences is A333214.
The version for weak ascents is A333230.
First differences are A333253 (if the first term is 0).
Prime gaps are A001223.
Weakly decreasing runs of compositions in standard order are A124765.
Strictly increasing runs of compositions in standard order are A124768.
Runs of prime gaps with nonzero differences are A333216.
Cf. A000040, A000720, A001221, A036263, A054819, A084758, A114994, A124760, A124761, A124766, A124769, A333212.

Accumulate[Length/@Split[Differences[Array[Prime,100]],#1<#2&]]//Most
- or -
Select[Range[100],Prime[#+1]-Prime[#]>=Prime[#+2]-Prime[#+1]&]

Numbers k such that prime(k+2) - 2*prime(k+1) + prime(k) >= 0.

A376603 Points of nonzero curvature in the sequence of composite numbers (A002808).

Original entry on oeis.org

2, 4, 6, 8, 10, 12, 13, 17, 19, 23, 24, 26, 28, 30, 31, 35, 36, 40, 42, 46, 47, 49, 51, 55, 56, 58, 59, 63, 64, 70, 71, 73, 75, 77, 79, 81, 82, 94, 95, 97, 98, 102, 104, 112, 114, 118, 119, 123, 124, 126, 127, 131, 132, 136, 138, 146, 148, 150, 152, 162, 163

Offset: 1

Gus Wiseman, Oct 05 2024

nonn

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

			The composite numbers (A002808) are:
  4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, ...
with first differences (A073783):
  2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, ...
with first differences (A073445):
  0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, ...
with nonzero terms at (A376603):
  2, 4, 6, 8, 10, 12, 13, 17, 19, 23, 24, 26, 28, 30, 31, 35, 36, 40, 42, 46, 47, ...

Dominic McCarty, Table of n, a(n) for n = 1..1000
Gus Wiseman, Points of nonzero curvature in the sequence of composite numbers.

Partitions into composite numbers are counted by A023895, factorizations A050370.
These are the positions of nonzero terms in A073445.
For first differences we had A073783, ones A375929, complement A065890.
For prime instead of composite we have A333214.
The complement is A376602.
For upward concavity (instead of nonzero) we have A376651, downward A376652.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376602 (zeros), A376651 (concave-up), A376652 (concave-down).
For nonzero curvature: A333214 (prime), A376589 (non-perfect-power), A376592 (squarefree), A376595 (nonsquarefree), A376598 (prime-power), A376601 (non-prime-power).
Cf. A000961, A064113, A246655, A251092, A258025, A333254.

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

A377288 Numbers k such that there are exactly two prime-powers between prime(k)+1 and prime(k+1)-1.

Original entry on oeis.org

4, 9, 30, 327, 3512

Offset: 1

Gus Wiseman, Oct 25 2024

Is this sequence finite? For this conjecture see A053706, A080101, A366833.

Any further terms are > 10^12. - Lucas A. Brown, Nov 08 2024

			Primes 9 and 10 are 23 and 29, and the interval (24, 25, 26, 27, 28) contains the prime-powers 25 and 27, so 9 is in the sequence.

Lucas A. Brown, Python program.

The interval from A008864(n) to A006093(n+1) has A046933 elements.
For powers of 2 instead of primes see A013597, A014210, A014234, A244508, A304521.
The corresponding primes are A053706.
The nearest prime-power before prime(n)-1 is A065514, difference A377289.
The nearest prime-power after prime(n)+1 is A345531, difference A377281.
These are the positions of 2 in A080101, or 3 in A366833.
For at least one prime-power we have A377057, primes A053607.
For no prime-powers we have A377286.
For exactly one prime-power we have A377287.
For squarefree instead of prime-power see A377430, A061398, A377431, A068360.
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.
A246655 lists the prime-powers not including 1, complement A361102.
Cf. A001597, A002808, A024619, A053707, A064113, A065890, A075526, A095195, A224363, A276781, A376596, A376597, A377282.

Select[Range[100], Length[Select[Range[Prime[#]+1,Prime[#+1]-1],PrimePowerQ]]==2&]

prime(a(n)) = A053706(n).

cp's OEIS Frontend

A333230 Positions of weak ascents in the sequence of differences between primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A333216 Lengths of maximal subsequences without adjacent equal terms in the sequence of prime gaps.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376591 Inflection and undulation points in the sequence of squarefree numbers (A005117).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A376602 Inflection and undulation points in the sequence of composite numbers (A002808).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A333215 Lengths of maximal weakly increasing subsequences in the sequence of prime gaps (A001223).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376683 Antidiagonal-sums of the array A376682(n,k) = n-th term of the k-th differences of the noncomposite numbers (A008578).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A377037 Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A333231 Positions of weak descents in the sequence of differences between primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica