A065890 -id:A065890 - cp's OEIS frontend

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

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

A377035 Antidiagonal-sums of the absolute value of the array A377033(n,k) = n-th term of the k-th differences of the composite numbers (A002808).

Original entry on oeis.org

4, 8, 10, 12, 14, 18, 21, 28, 34, 40, 47, 74, 96, 110, 138, 286, 715, 2393, 8200, 25731, 72468, 184716, 431575, 934511, 1892267, 3605315, 6494464, 11116110, 18134549, 28348908, 42701927, 62290660, 88313069, 120999433, 159769475, 221775851, 483797879

Offset: 1

Gus Wiseman, Oct 18 2024

nonn

			The fourth antidiagonal of A377033 is (9, 1, -1, -1), so a(4) = 12.

The version for prime instead of composite is A376681, absolute version of A140119.
The version for noncomposite is A376684, absolute version of A376683.
This is the antidiagonal-sums of absolute value of the array A377033.
For squarefree instead of composite we have A377040, absolute version of A377039.
For nonsquarefree instead of composite we have A377048, absolute version of A377047.
For prime-power instead of composite we have A377053, absolute version of A377052.
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, A333254, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680, A377036.

q=Select[Range[120],CompositeQ];
t=Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[i+k]],{k,0,j}],{j,0,Length[q]/2},{i,Length[q]/2}];
Total/@Table[Abs[t[[j,i-j+1]]],{i,Length[q]/2},{j,i}]

A375929 Numbers k such that A002808(k+1) = A002808(k) + 1. In other words, the k-th composite number is 1 less than the next.

Original entry on oeis.org

3, 4, 7, 8, 11, 12, 14, 15, 16, 17, 20, 21, 22, 23, 25, 26, 29, 30, 32, 33, 34, 35, 37, 38, 39, 40, 43, 44, 45, 46, 48, 49, 52, 53, 54, 55, 57, 58, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 72, 73, 76, 77, 80, 81, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94

Offset: 1

Gus Wiseman, Sep 12 2024

nonn

Positions of 1's in A073783 (see also A054546, A065310).

			The composite numbers are 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ... which increase by 1 after positions 3, 4, 7, 8, ...

Positions in A002808 of each element of A068780.
The complement is A065890 shifted.
First differences are A373403 (except first).
The version for non-prime-powers is A375713, differences A373672.
The version for prime-powers is A375734, differences A373671.
The version for non-perfect-powers is A375740.
The version for nonprime numbers is A375926.
A000040 lists the prime numbers, differences A001223.
A000961 lists prime-powers (inclusive), differences A057820.
A002808 lists the composite numbers, differences A073783.
A018252 lists the nonprime numbers, differences A065310.
A046933 counts composite numbers between primes.
Cf. A014689, A054546, A176246, A246655, A251092.

Join@@Position[Differences[Select[Range[100],CompositeQ]],1]

from sympy import primepi
def A375929(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 n+bisection(lambda y:primepi(x+2+y))-2
    return bisection(f,n,n) # Chai Wah Wu, Sep 15 2024

# faster for initial segment of sequence
from sympy import isprime
from itertools import count, islice
def agen(): # generator of terms
    pic, prevc = 0, -1
    for i in count(4):
        if not isprime(i):
            if i == prevc + 1:
                yield pic
            pic, prevc = pic+1, i
print(list(islice(agen(), 10000))) # Michael S. Branicky, Sep 17 2024

a(n) = A375926(n) - 1.

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)

A378370 Distance between n and the least prime power >= n, allowing 1.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Nov 27 2024

nonn

Prime powers allowing 1 are listed by A000961.

Sequences obtained by adding n to each term are placed in parentheses below.
For prime instead of prime power we have A007920 (A007918), strict A013632.
For perfect power we have A074984 (A377468), opposite A069584 (A081676).
For squarefree we have A081221 (A067535).
The restriction to the prime numbers is A377281 (A345531).
The strict version is A377282 = a(n) + 1.
For non prime power instead of prime power we have A378371 (A378372).
The opposite version is A378457, strict A276781.
A000015 gives the least prime power >= n, opposite A031218.
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.
Prime-powers between primes: A053607, A080101, A304521, A366833, A377057.
Cf. A001597, A053707, A065514, A065890, A343249, A376596, A376597, A377051, A377054, A377289, A377781.

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

a(n) = A000015(n) - n.

a(n) = A377282(n - 1) - 1 for n > 1.

A092435 Prime factorials divided by their corresponding primorials.

Original entry on oeis.org

1, 1, 4, 24, 17280, 207360, 696729600, 12541132800, 115880067072000, 1366643159020339200000, 40999294770610176000000, 1854768736099424576471040000000, 109950690675973888893203251200000000, 4617929008390903333514536550400000000, 420600974084243475616503989010432000000000

Offset: 1

Don Willard (dwillard(AT)prairie.cc.il.us), Mar 23 2004

nonn

			E.g., 2 factorial divided by 2 primorial is 1; 3 factorial is 6, divided by 3 primorial (3*2=6) is also 1; 5 factorial is 120, divided by 5 primorial (5*3*2=30) is 4 and so forth.

Subsequence of A036691. - Chayim Lowen, Jul 23 2015

Cf. A002110, A039716.

a:= proc(n) option remember; `if`(n<2, 1,
      a(n-1)*mul(i, i=ithprime(n-1)+1..ithprime(n)-1))
    end:
seq(a(n), n=1..15);  # Alois P. Heinz, Jan 15 2025

Table[ Prime[n]! / Times @@ Prime[ Range[ n]], {n, 13}] (* Robert G. Wilson v, Mar 25 2004 *)

a(n)=prime(n)!/prod(i=1,n,prime(i)) \\ Ralf Stephan, Dec 21 2013

p!/p# = A039716/A002110.
Partial products of A061214. - Lekraj Beedassy, Nov 06 2006
From Chayim Lowen, Jul 23 - Aug 05 2015: (Start)
a(n) = A036691(A065890(n)).
a(n) = A000142(A002808(A065890(n)))/A034386(A002808(A065890(n))).
a(n) = Product_{k=1..n} prime(k)^(A085604(prime(n),k)-1).
a(n) = A049614(prime(n)).
a(n) = Product_{k=1..prime(n)} k^A066247(k). (End)

Edited by Robert G. Wilson v, Mar 25 2004

More terms from Michel Marcus, Jan 15 2025

A378373 Number of composite numbers (A002808) between consecutive nonsquarefree numbers (A013929), exclusive.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Dec 02 2024

nonn

All terms are 0, 1, 2, or 3 (cf. A078147).
The inclusive version is a(n) + 2.
The nonsquarefree numbers begin: 4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, ...

			The composite numbers counted by a(n) form the following set partition of A120944:
{6}, {}, {10}, {14,15}, {}, {}, {21,22}, {}, {26}, {}, {30}, {33,34,35}, {38,39}, ...

For prime (instead of nonsquarefree) we have A046933.
For squarefree (instead of nonsquarefree) we have A076259(n)-1.
For prime power (instead of nonsquarefree) we have A093555.
For prime instead of composite we have A236575.
For nonprime prime power (instead of nonsquarefree) we have A378456.
For perfect power (instead of nonsquarefree) we have A378614, primes A080769.
A002808 lists the composite numbers.
A005117 lists the squarefree numbers, differences A076259.
A013929 lists the nonsquarefree numbers, differences A078147.
A073247 lists squarefree numbers with nonsquarefree neighbors.
A120944 lists squarefree composite numbers.
A377432 counts perfect-powers between primes, zeros A377436.
A378369 gives distance to the next nonsquarefree number (A120327).
Cf. A065890, A067535, A067871, A080101, A081221, A151800, A243348, A366833, A377046, A378033, A378039, A378086.

v=Select[Range[100],!SquareFreeQ[#]&];
Table[Length[Select[Range[v[[i]]+1,v[[i+1]]-1],CompositeQ]],{i,Length[v]-1}]

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

A162177 a(n) is the number of composite numbers that are smaller than A008578(n).

Original entry on oeis.org

0, 0, 0, 1, 2, 5, 6, 9, 10, 13, 18, 19, 24, 27, 28, 31, 36, 41, 42, 47, 50, 51, 56, 59, 64, 71, 74, 75, 78, 79, 82, 95, 98, 103, 104, 113, 114, 119, 124, 127, 132, 137, 138, 147, 148, 151, 152, 163, 174, 177, 178, 181, 186, 187, 196, 201, 206, 211, 212, 217, 220, 221

Offset: 1

Jaroslav Krizek, Jun 27 2009

Essentially the same as A065890.

a(n) = number of terms of A073169(n) less than n.

			A008578(6) = 11, and there are 5 composites smaller than 11, viz. 4, 6, 8, 9, 10, hence a(6) = 5.

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A002808 (composites), A008578 (1 and the primes), A065890, A073169.

T:=[0,1] cat PrimesUpTo(300); [ T[n+1]-n: n in [1..#T-1] ]; // Klaus Brockhaus, Sep 08 2009

Join[{0},Module[{nn=300,cmps},cmps=Accumulate[Table[If[CompositeQ[n],1,0],{n,nn}]];Table[cmps[[p]],{p,Prime[ Range[ PrimePi[ nn]]]}]]] (* Harvey P. Dale, Nov 11 2024 *)

a(n) = A008578(n) - n = A158611(n+1) -n.

a(n) = A065890(n-1) for n > 1.

Edited and extended by Klaus Brockhaus, Sep 09 2009

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.

cp's OEIS Frontend

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

A377035 Antidiagonal-sums of the absolute value of the array A377033(n,k) = n-th term of the k-th differences of the composite numbers (A002808).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A375929 Numbers k such that A002808(k+1) = A002808(k) + 1. In other words, the k-th composite number is 1 less than the next.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Python

Formula

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

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula

A378370 Distance between n and the least prime power >= n, allowing 1.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula

A092435 Prime factorials divided by their corresponding primorials.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A378373 Number of composite numbers (A002808) between consecutive nonsquarefree numbers (A013929), exclusive.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A162177 a(n) is the number of composite numbers that are smaller than A008578(n).

Views