A377033 -id:A377033 - 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

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

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

A378622 Array read by antidiagonals downward where A(n,k) is the n-th term of the k-th differences of the strict partition numbers A000009.

Original entry on oeis.org

1, 1, 0, 1, 0, 0, 2, 1, 1, 1, 2, 0, -1, -2, -3, 3, 1, 1, 2, 4, 7, 4, 1, 0, -1, -3, -7, -14, 5, 1, 0, 0, 1, 4, 11, 25, 6, 1, 0, 0, 0, -1, -5, -16, -41, 8, 2, 1, 1, 1, 1, 2, 7, 23, 64, 10, 2, 0, -1, -2, -3, -4, -6, -13, -36, -100, 12, 2, 0, 0, 1, 3, 6, 10, 16, 29, 65, 165

Offset: 0

Gus Wiseman, Dec 13 2024

			As a table (read by antidiagonals downward):
        n=0:  n=1:  n=2:  n=3:  n=4:  n=5:  n=6:  n=7:  n=8:
  ----------------------------------------------------------
  k=0:   1     1     1     2     2     3     4     5     6
  k=1:   0     0     1     0     1     1     1     1     2
  k=2:   0     1    -1     1     0     0     0     1     0
  k=3:   1    -2     2    -1     0     0     1    -1     0
  k=4:  -3     4    -3     1     0     1    -2     1     1
  k=5:   7    -7     4    -1     1    -3     3     0    -3
  k=6: -14    11    -5     2    -4     6    -3    -3     7
  k=7:  25   -16     7    -6    10    -9     0    10   -14
  k=8: -41    23   -13    16   -19     9    10   -24    24
  k=9:  64   -36    29   -35    28     1   -34    48   -34
As a triangle (read by rows):
   1
   1   0
   1   0   0
   2   1   1   1
   2   0  -1  -2  -3
   3   1   1   2   4   7
   4   1   0  -1  -3  -7 -14
   5   1   0   0   1   4  11  25
   6   1   0   0   0  -1  -5 -16 -41
   8   2   1   1   1   1   2   7  23  64

Rows are: A000009 (k=0), A087897 (k=1, without first term), A378972 (k=2).
For primes we have A095195 or A376682.
For partitions we have A175804.
First column is A293467 (up to sign).
For composites we have A377033.
For squarefree numbers we have A377038.
For nonsquarefree numbers we have A377046.
For prime powers we have A377051.
Position of first zero in each row is A377285.
Triangle's row-sums are A378970, absolute A378971.
A000009 counts strict integer partitions, differences A087897, A378972.
A000041 counts integer partitions, differences A002865, A053445.
Cf. A047966, A098859, A225486, A325244, A325282.
Cf. A008284, A116608, A325242, A225485 or A325280.

nn=20;
t=Table[Take[Differences[PartitionsQ/@Range[0,2nn],k],nn],{k,0,nn}];
Table[t[[j,i-j+1]],{i,nn/2},{j,i}]

A379300 Number of prime indices of n that are composite.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 2, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1

Offset: 1

Gus Wiseman, Dec 25 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 prime indices of 39 are {2,6}, so a(39) = 1.
The prime indices of 70 are {1,3,4}, so a(70) = 1.
The prime indices of 98 are {1,4,4}, so a(98) = 2.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 3.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.

Positions of first appearances are A000420.
Positions of zero are A302540, counted by A034891 (strict A036497).
Positions of one are A379301, counted by A379302 (strict A379303).
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.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers, see A073445, A377034-A377037.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A000586, A000607, A076610, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.
- A379311 old prime, see A379312-A379315.
Cf. A023895, A113646, A175804, A204389, A320629, A376680, A378373, A378456.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[prix[n],CompositeQ]],{n,100}]

Totally additive with a(prime(k)) = A066247(k).

A379302 Number of integer partitions of n with a unique composite part.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 3, 4, 7, 11, 16, 23, 32, 43, 58, 77, 100, 129, 164, 207, 259, 323, 398, 489, 595, 723, 872, 1049, 1255, 1495, 1774, 2097, 2472, 2903, 3399, 3969, 4618, 5362, 6210, 7173, 8268, 9506, 10907, 12488, 14271, 16278, 18532, 21061, 23893, 27064

Offset: 0

Gus Wiseman, Dec 25 2024

nonn

			The a(0) = 0 through a(9) = 11 partitions:
  .  .  .  .  (4)  (41)  (6)    (43)    (8)      (9)
                         (42)   (61)    (62)     (54)
                         (411)  (421)   (422)    (63)
                                (4111)  (431)    (81)
                                        (611)    (432)
                                        (4211)   (621)
                                        (41111)  (4221)
                                                 (4311)
                                                 (6111)
                                                 (42111)
                                                 (411111)

If all parts are composite we have A023895 (strict A204389), ranks A320629.
If no parts are composite we have A034891 (strict A036497), ranks A302540.
Ranked by A379301 = positions of 1 in A379300.
The strict case is A379303.
For a unique prime part we have A379304 (strict A379305), ranks A331915.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers.
Cf. A000070, A000586, A000607, A002095, A038348, A096258, A114374, A330944, A379308, A379309, A379314, A379315.

Table[Length[Select[IntegerPartitions[n],Count[#,_?CompositeQ]==1&]],{n,0,30}]

A179278 Largest nonprime integer <= n.

Original entry on oeis.org

1, 1, 1, 4, 4, 6, 6, 8, 9, 10, 10, 12, 12, 14, 15, 16, 16, 18, 18, 20, 21, 22, 22, 24, 25, 26, 27, 28, 28, 30, 30, 32, 33, 34, 35, 36, 36, 38, 39, 40, 40, 42, 42, 44, 45, 46, 46, 48, 49, 50, 51, 52, 52, 54, 55, 56, 57, 58, 58, 60, 60, 62, 63, 64, 65, 66, 66, 68, 69, 70, 70, 72

Offset: 1

Reinhard Zumkeller, Jul 08 2010

			From _Gus Wiseman_, Dec 04 2024: (Start)
The nonprime integers <= n:
  1  1  1  4  4  6  6  8  9  10  10  12  12  14  15  16
           1  1  4  4  6  8  9   9   10  10  12  14  15
                 1  1  4  6  8   8   9   9   10  12  14
                       1  4  6   6   8   8   9   10  12
                          1  4   4   6   6   8   9   10
                             1   1   4   4   6   8   9
                                     1   1   4   6   8
                                             1   4   6
                                                 1   4
                                                     1
(End)

Cf. A014684, A113523, A113638, A062298.
For prime we have A007917.
For nonprime we have A179278 (this).
For squarefree we have A070321.
For nonsquarefree we have A378033.
For prime power we have A031218.
For non prime power we have A378367.
For perfect power we have A081676.
For non perfect power we have A378363.
A000040 lists the primes, differences A001223.
A002808 lists the composite numbers, differences A073783.
A018252 lists the nonprimes, differences A065310.
A095195 has row n equal to the k-th differences of the prime numbers.
A113646 gives least nonprime >= n.
A151800 gives the least prime > n, weak version A007918.
A377033 has row n equal to the k-th differences of the composite numbers.

Array[# - Boole[PrimeQ@ #] - Boole[# == 3] &, 72] (* Michael De Vlieger, Oct 13 2018 *)
Table[Max@@Select[Range[n],!PrimeQ[#]&],{n,30}] (* Gus Wiseman, Dec 04 2024 *)

a(n) = if (isprime(n), if (n==3, 1, n-1), n); \\ Michel Marcus, Oct 13 2018

For n > 3: a(n) = A113523(n) = A014684(n);
For n > 0: a(n) = A113638(n). - Georg Fischer, Oct 12 2018
A005171(a(n)) = 1; A010051(a(n)) = 0.
a(n) = A018252(A062298(n)). - Ridouane Oudra, Aug 22 2025

Inequality in the name reversed by Gus Wiseman, Dec 05 2024

A379303 Number of strict integer partitions of n with a unique composite part.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 2, 3, 3, 6, 6, 8, 10, 10, 13, 15, 17, 20, 22, 24, 28, 31, 36, 40, 44, 50, 55, 62, 70, 75, 83, 89, 97, 108, 115, 128, 136, 146, 161, 172, 188, 203, 215, 233, 249, 269, 291, 309, 331, 353, 376, 405, 433, 459, 490, 518, 554, 592, 629, 670, 705

Offset: 0

Gus Wiseman, Dec 25 2024

nonn

			The a(4) = 1 through a(11) = 8 partitions:
  (4)  (4,1)  (6)    (4,3)    (8)      (9)      (10)       (6,5)
              (4,2)  (6,1)    (6,2)    (5,4)    (8,2)      (7,4)
                     (4,2,1)  (4,3,1)  (6,3)    (9,1)      (8,3)
                                       (8,1)    (5,4,1)    (9,2)
                                       (4,3,2)  (6,3,1)    (10,1)
                                       (6,2,1)  (4,3,2,1)  (5,4,2)
                                                           (6,3,2)
                                                           (8,2,1)

If no parts are composite we have A036497,  non-strict A034891 (ranks A302540).
If all parts are composite we have A204389, non-strict A023895 (ranks A320629).
The non-strict version is A379302, ranks A379301 (positions of 1 in A379300).
For a unique prime we have A379305, non-strict A379304 (ranks A331915).
A000040 lists the prime numbers, differences A001223.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers, see A073445, A377034-A377037.
Cf. A000070, A000586, A000607, A002095, A038348, A096258, A113646, A376680, A379308, A379309, A379314, A379315.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Count[#,_?CompositeQ]==1&]],{n,0,30}]

A377036 First term of the n-th differences of the composite numbers. Inverse zero-based binomial transform of A002808.

Original entry on oeis.org

4, 2, 0, -1, 2, -2, 0, 4, -8, 8, 0, -16, 32, -32, -1, 78, -233, 687, -2363, 8160, -25670, 72352, -184451, 430937, -933087, 1888690, -3597221, 6479696, -11086920, 18096128, -28307626, 42644791, -62031001, 86466285, -110902034, 110907489, -52325, -483682930

Offset: 0

Gus Wiseman, Oct 18 2024

sign

The version for prime instead of composite is A007442.
For noncomposite numbers we have A030016.
This is the first column (n=1) of A377033.
For row-sums we have A377034, absolute version A377035.
First zero positions are A377037, cf. A376678, A376855, A377042, A377050, A377055.
For squarefree instead of composite we have A377041, nonsquarefree A377049.
For prime-power instead of composite we have A377054.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, seconds A036263.
A002808 lists the composite numbers, differences A073783, seconds A073445.
A008578 lists the noncomposites, differences A075526.
Cf: A018252, A065310, A065890, A140119, A173390, A333214, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680.

q=Select[Range[100],CompositeQ];
t=Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[1+k]],{k,0,j}],{j,0,Length[q]-1}]

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

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

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

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

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

Programs

Mathematica

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A378622 Array read by antidiagonals downward where A(n,k) is the n-th term of the k-th differences of the strict partition numbers A000009.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A379300 Number of prime indices of n that are composite.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A379302 Number of integer partitions of n with a unique composite part.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A179278 Largest nonprime integer <= n.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A379303 Number of strict integer partitions of n with a unique composite part.

Views

Author

Keywords

Examples