A075526 -id:A075526 - cp's OEIS frontend

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

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

A377054 First term of the n-th differences of the powers of primes. Inverse zero-based binomial transform of A000961.

Original entry on oeis.org

1, 1, 0, 0, 0, 1, -5, 15, -34, 63, -97, 115, -54, -251, 1184, -3536, 8736, -18993, 37009, -64545, 98442, -121393, 82008, 147432, -860818, 2710023, -7110594, 17077281, -38873146, 85085287, -179965647, 367885014, -725051280, 1372311999, -2481473550, 4257624252

Offset: 0

Gus Wiseman, Oct 22 2024

sign

			The sixth differences of A000961 begin: -5, 10, -9, 1, 6, -10, 16, -18, ..., so a(6) = -5.

The version for primes is A007442, noncomposites A030016, composites A377036.
For squarefree numbers we have A377041, nonsquarefree A377049.
This is the first column of the array A377051.
For antidiagonal-sums we have A377052, absolute A377053.
For positions of first zeros we have A377055.
A000040 lists the primes, differences A001223, seconds A036263.
A000961 lists the powers of primes, differences A057820.
A001597 lists perfect-powers, complement A007916.
A008578 lists the noncomposites, differences A075526.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
Cf. A025475, A053707, A093555, A174965, A175804, A246655, A361102, A376340, A376596, A377056.

q=Select[Range[100],#==1||PrimePowerQ[#]&];
Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[1+k]],{k,0,j}],{j,0,Length[q]/2}]

The inverse zero-based binomial transform of a sequence (q(0), q(1), q(2), ...) is the sequence p given by:

p(j) = sum_{k=0..j} (-1)^(j-k)*binomial(j,k)*q(k)

A054541 Sum of first n terms equals n-th prime.

Original entry on oeis.org

2, 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, 6, 6, 2, 6, 4, 2, 10, 14, 4, 2, 4, 14, 6, 10, 2, 4, 6, 8, 6, 6, 4, 6, 8, 4, 8, 10, 2, 10, 2, 6, 4, 6, 8, 4, 2, 4, 12, 8, 4, 8, 4, 6

Offset: 1

G. L. Honaker, Jr., Apr 09 2000

nonn

Except for first term, same as A001223.
First differences of A182986. - Omar E. Pol, Oct 31 2013
A075526 is 1 together with A001223. This is 2 together with A001223. A125266 is 3 together with A001223. - Omar E. Pol, Nov 01 2013
Convolved with A024916 gives A086718. - Omar E. Pol, Dec 23 2021

Partial sums give A000040.

Cf. A001223, A075526, A086718, A024916, A125266, A182986.

Join[{2},Differences[Prime[Range[100]]]] (* Paolo Xausa, Oct 25 2023 *)

a(n) = if (n==1, 2, prime(n) - prime(n-1)); \\ Michel Marcus, Oct 31 2013

More terms from James Sellers, Apr 11 2000

A173390 n-th difference between consecutive natural noncomposite numbers = n-th difference between consecutive prime numbers.

Original entry on oeis.org

1, 3, 16, 37, 40, 47, 55, 56, 74, 103, 108, 111, 119, 130, 161, 165, 185, 188, 195, 200, 219, 240, 272, 273, 292, 340, 359, 388, 420, 427, 465, 466, 509, 521, 554, 600, 606, 622, 630, 634, 668, 683, 684, 703, 710, 711, 734, 762, 792, 814, 822, 823, 830, 831

Offset: 1

Juri-Stepan Gerasimov, Feb 17 2010

nonn

Numbers n such that A075526(n) = A001223(n).

Essentially the same as A066875. - R. J. Mathar, Feb 21 2010

Cf. A001223, A075526.

A075526(a(n)) = A001223(a(n)).

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).

A379312 Positive integers whose prime indices include a unique 1 or prime number.

Original entry on oeis.org

2, 3, 5, 11, 14, 17, 21, 26, 31, 35, 38, 39, 41, 46, 57, 58, 59, 65, 67, 69, 74, 77, 83, 86, 87, 94, 95, 98, 106, 109, 111, 115, 119, 122, 127, 129, 141, 142, 143, 145, 146, 147, 157, 158, 159, 178, 179, 182, 183, 185, 191, 194, 202, 206, 209, 211, 213, 214

Offset: 1

Gus Wiseman, Dec 28 2024

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The terms together with their prime indices begin:
    2: {1}
    3: {2}
    5: {3}
   11: {5}
   14: {1,4}
   17: {7}
   21: {2,4}
   26: {1,6}
   31: {11}
   35: {3,4}
   38: {1,8}
   39: {2,6}
   41: {13}
   46: {1,9}
   57: {2,8}
   58: {1,10}
   59: {17}
   65: {3,6}
   67: {19}
   69: {2,9}
   74: {1,12}
   77: {4,5}

These "old" primes are listed by A008578.
For no composite parts we have A302540, counted by A034891 (strict A036497).
For all composite parts we have A320629, counted by A023895 (strict A204389).
For a unique prime part we have A331915, counted by A379304 (strict A379305).
Positions of ones in A379311, see A379313.
Partitions of this type are counted by A379314, strict A379315.
A000040 lists the prime numbers, differences A001223.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A080339 is the characteristic function for the old prime numbers.
A376682 gives k-th differences of old prime numbers, see A030016, A075526.
Other counts of prime indices:
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A000586, A000607, A076610, A331386.
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.
Cf. A038550, A073445, A087436, A173390, A379300, A379301, A379302.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],Length[Select[prix[#],#==1||PrimeQ[#]&]]==1&]

A376681 Row sums of the absolute value of the array A095195(n, k) = n-th term of the k-th differences of the prime numbers (A000040).

Original entry on oeis.org

2, 4, 8, 10, 22, 36, 72, 134, 266, 500, 874, 1418, 2044, 2736, 4626, 15176, 41460, 95286, 196368, 372808, 660134, 1092790, 1682198, 2384724, 3147706, 4526812, 11037090, 36046768, 93563398, 214796426, 452129242, 885186658, 1619323680, 2763448574, 4368014812

Offset: 1

Gus Wiseman, Oct 15 2024

nonn

			The fourth row of A095195 is: (7, 2, 0, -1), so a(4) = 10.

For firsts instead of row-sums we have A007442 (modern version of A030016).
This is the absolute version of A140119.
If 1 is considered prime (A008578) we get A376684, absolute version of A376683.
For first zero-positions we have A376678 (modern version of A376855).
For composite instead of prime we have A377035.
For squarefree instead of prime we have A377040, nonsquarefree A377048.
A000040 lists the modern primes, differences A001223, seconds A036263.
A008578 lists the noncomposites, differences A075526, seconds A036263 with 0 prepended.
Cf. A064113, A065890, A084758, A173390, A233671, A258025, A333214, A333254, A376602, A376651, A376652, A377033.

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

More terms from Pontus von Brömssen, Oct 17 2024

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}]

A376684 Antidiagonal-sums of the absolute value 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, 12, 27, 50, 109, 224, 471, 942, 1773, 3118, 4957, 7038, 9373, 16256, 55461, 150622, 346763, 718972, 1377101, 2462220, 4114987, 6387718, 9112455, 12051830, 17160117, 40946860, 134463917, 349105370, 800713921, 1684145408, 3297536923, 6040907554

Offset: 0

Gus Wiseman, Oct 15 2024

nonn

			The fourth antidiagonal of A376682 is: (7, 2, 0, -1, -2), so a(4) = 12.

For the modern primes (A000040) we have A376681, absolute version of A140119.
For firsts instead of row-sums we have A030016, modern A007442.
These are the antidiagonal-sums of the absolute value of A376682 (modern A095195).
This is the absolute version of A376683.
For first zero-positions we have A376855, modern A376678.
A000040 lists the modern primes, differences A001223, seconds A036263.
A008578 lists the noncomposites, first differences A075526.
Cf. A002808, A064113, A065890, A173390, A233671, A258025, A333214, A333254, A376680, A377033, A377037.

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

A376855 Position of first 0 in the n-th differences of the noncomposite numbers (A008578), or 0 if it does not appear.

Original entry on oeis.org

0, 0, 1, 8, 70, 14, 48, 59, 10, 44, 3554, 101, 7020, 14083, 68098, 14527, 149678, 2698, 481055, 979720, 631895, 29812, 25340979, 50574255, 7510844, 210829338, 67248862, 224076287, 910615648, 931510270, 452499645, 2880203723, 396680866, 57954439971, 77572822441, 35394938649

Offset: 0

Gus Wiseman, Oct 15 2024

nonn

			The third differences of the noncomposite numbers begin: 1, -1, 2, -4, 4, -4, 4, 0, -6, 8, ... so a(3) = 8.

Lucas A. Brown, Python program.

For firsts instead of positions of zeros we have A030016, modern A007442.
These are the first zero-positions in A376682, modern A376678.
For row-sums instead of zero-positions we have A376683, modern A140119.
For absolute row-sums we have A376684, modern A376681.
For composite instead of noncomposite we have A377037.
For squarefree instead of noncomposite we have A377042, nonsquarefree A377050.
For prime-power instead of noncomposite we have A377055.
A000040 lists the modern primes, differences A001223, seconds A036263.
A008578 lists the noncomposite numbers, first differences A075526.
Cf. A002808, A064113, A065890, A084758, A173390, A258025, A333214, A333215, A333254, A377033.

nn=10000;
u=Table[Differences[Select[Range[nn],#==1||PrimeQ[#]&],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(16)-a(21) from Alois P. Heinz, Oct 18 2024

a(22)-a(35) from Lucas A. Brown, Nov 03 2024

cp's OEIS Frontend

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

A377054 First term of the n-th differences of the powers of primes. Inverse zero-based binomial transform of A000961.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Formula

A054541 Sum of first n terms equals n-th prime.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

A173390 n-th difference between consecutive natural noncomposite numbers = n-th difference between consecutive prime numbers.

Views

Author

Keywords

Comments

Crossrefs

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A379312 Positive integers whose prime indices include a unique 1 or prime number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A376681 Row sums of the absolute value of the array A095195(n, k) = n-th term of the k-th differences of the prime numbers (A000040).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Extensions

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

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

Views

Author

Keywords

Examples

Crossrefs