A054546 -id:A054546 - cp's OEIS frontend

A173401 Numbers k such that A075526(k-1) = A054546(k).

1, 3, 4, 8, 11, 21, 29, 44, 53, 58, 61, 84, 105, 121, 149, 153, 179, 183, 213, 295, 308, 374, 461, 502, 535, 552, 609, 637, 659, 727, 730, 756, 850, 859, 865, 875, 885, 914, 1005, 1055, 1105, 1239, 1261, 1306, 1321, 1407, 1443, 1616, 1654, 1769, 1783, 1795, 1836

Offset: 1

Juri-Stepan Gerasimov, Feb 17 2010

Cf. A054546, A075526, A173390, A173400.

A008578 := proc(n) if n =1 then 1; else ithprime(n-1) ; end if; end proc:
A075526 := proc(n) A008578(n+2)-A008578(n+1) ; end proc:
A054546 := proc(n) if n <= 2 then op(n,[1,3]) ; else A002808(n-1)-A002808(n-2) ; end if; end proc:
for n from 1 to 2000 do if A075526(n-1) = A054546(n) then printf("%d,",n) ; end if; end do: # R. J. Mathar, Apr 24 2010

Formula index corrected, a(14) corrected and sequence extended beyond a(14) by R. J. Mathar, Apr 25 2010

A141468 Zero together with the nonprime numbers A018252.

Original entry on oeis.org

0, 1, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88

Offset: 1

Juri-Stepan Gerasimov, Aug 11 2008

nonn

0 and 1 together with the composite numbers (A002808). - Omar E. Pol, Jul 04 2009

N. J. A. Sloane, Table of n, a(n) for n = 1..17739

Cf. A018252, A002808, A054546 (first differences).

a141468 n = a141468_list !! (n-1)
a141468_list = 0 : a018252_list  -- Reinhard Zumkeller, May 31 2013

A141468 := proc(n) option remember; local a; if n <=2 then n-1 ; else for a from procname(n-1)+1 do if not isprime(a) then return a; end if; end do; end if; end proc: # R. J. Mathar, Dec 13 2010

nonPrime[n_Integer] := FixedPoint[n + PrimePi@# &, n + PrimePi@ n]; Array[ nonPrime, 66, 0] (* Robert G. Wilson v, Jan 29 2015 *)
Join[{0,1},Select[Range[100],CompositeQ]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Oct 22 2017 *)

a(n) = my(k=0); n--; while(-n+n+=-k+k=primepi(n), ); n; \\ Ruud H.G. van Tol, Jul 15 2024

list(lim)=if(lim<1, return(if(lim<0,[],[0]))); my(v=List([0,1])); forcomposite(n=4,lim\1, listput(v,n)); Vec(v) \\ Charles R Greathouse IV, Jul 15 2024

from sympy import composite
def A141468(n): return n-1 if n < 3 else composite(n-2) # Chai Wah Wu, Oct 11 2024

a(1) = 0; a(n) = A018252(n-1), n > 1. - Omar E. Pol, Aug 13 2009
a(n) = A018252(n) - A054546(n). - Omar E. Pol, Oct 21 2011
a(n) = A002808(n-2) for n > 2 . - Robert G. Wilson v, Jan 29 2015, corrected by Rémi Guillaume, Aug 26 2024.

Added 68 by R. J. Mathar, Aug 14 2008

Better definition from Omar E. Pol, Jun 30 2009

A073445 Second differences of A002808, the sequence of composites.

Original entry on oeis.org

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, 1, 0, -1, 0, 1, -1, 0, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, 1, -1, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 1, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0

Offset: 1

Labos Elemer, Aug 01 2002

			From _Gus Wiseman_, Oct 10 2024: (Start)
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, ...
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, ...
(End)

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Also first differences of A054546.
For first differences we had A073783 (ones A375929), run-lengths A376680.
Positions of zeros are A376602.
Positions of nonzeros are A376603.
Positions of ones are A376651, negative-ones A376652.
A002808 lists the composite numbers.
A064113 lists positions of adjacent equal prime gaps.
A333254 gives run-lengths of differences between consecutive primes.
Other second differences: A036263 (prime), A376590 (squarefree), A376596 (prime-power), A376604 (Kolakoski).
Cf. A076259, A174965, A251092, A376562, A376593, A376599.

a073445 n = a073445_list !! (n-1)
a073445_list = zipWith (-) (tail a073783_list) a073783_list
-- Reinhard Zumkeller, Jan 10 2013

c[x_] := FixedPoint[x+PrimePi[ # ]+1&, x]; Table[c[w+2]-2*c[w+1]+c[w], {w, 200}]
(* second program *)
Differences[Select[Range[100],CompositeQ],2] (* Gus Wiseman, Oct 08 2024 *)

from sympy import primepi
def A073445(n):
    def iterfun(f,n=0):
        m, k = n, f(n)
        while m != k: m, k = k, f(k)
        return m
    return (a:=iterfun(f:=lambda x:n+primepi(x)+1,n))-((b:=iterfun(lambda x:f(x)+1,a))<<1)+iterfun(lambda x:f(x)+2,b) # Chai Wah Wu, Oct 03 2024

a(n) = c(n+2)-2*c(n+1)+c(n), where c(n) = A002808(n).

a(n) = A073783(n+1) - A073783(n). - Reinhard Zumkeller, Jan 10 2013

A065310 Number of occurrences of n-th prime in A065308, where A065308(j) = prime(j - pi(j)).

Original entry on oeis.org

3, 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, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2

Offset: 1

Labos Elemer, Oct 29 2001

nonn

Seems identical to A054546. Each odd prime arises once or twice!?

First differences of A018252 (positive nonprime numbers). Including 0 gives A054546. Removing 1 gives A073783. - Gus Wiseman, Sep 15 2024

Harry J. Smith, Table of n, a(n) for n = 1..1000

Cf. A000040, A000720, A054576, A065308-A065309.
For twin 2's see A169643.
Positions of 1's are A375926, complement A014689 (except first term).
Other families of numbers and their first-differences:
For prime numbers (A000040) we have A001223.
For composite numbers (A002808) we have A073783.
For nonprime numbers (A018252) we have A065310 (this).
For perfect powers (A001597) we have A053289.
For non-perfect-powers (A007916) we have A375706.
For squarefree numbers (A005117) we have A076259.
For nonsquarefree numbers (A013929) we have A078147.
For prime-powers inclusive (A000961) we have A057820.
For prime-powers exclusive (A246655) we have A057820(>1).
For non-prime-powers inclusive (A024619) we have A375735.
For non-prime-powers exclusive (A361102) we have A375708.
Cf. A046933, A053707, A054546, A110969, A176246, A251092, A373403, A375929.

t=Table[Prime[w-PrimePi[w]], {w, a, b}] Table[Count[t, Prime[n]], {n, c, d}]
Differences[Select[Range[100],!PrimeQ[#]&]] (* Gus Wiseman, Sep 15 2024 *)

{ p=1; f=2; m=1; for (n=1, 1000, a=0; p=nextprime(p + 1); while (p==f, a++; m++; f=prime(m - primepi(m))); write("b065310.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 16 2009

A376680 Run-lengths of first differences of composite numbers.

Original entry on oeis.org

2, 2, 2, 2, 2, 2, 1, 4, 2, 4, 1, 2, 2, 2, 1, 4, 1, 4, 2, 4, 1, 2, 2, 4, 1, 2, 1, 4, 1, 6, 1, 2, 2, 2, 2, 2, 1, 12, 1, 2, 1, 4, 2, 8, 2, 4, 1, 4, 1, 2, 1, 4, 1, 4, 2, 8, 2, 2, 2, 10, 1, 10, 1, 2, 2, 2, 1, 4, 2, 8, 1, 4, 1, 4, 1, 4, 2, 4, 1, 2, 2, 8, 1, 12, 1, 2

Offset: 1

Gus Wiseman, Oct 10 2024

nonn

Also first differences of A376603 (points of nonzero curvature in the composite numbers).

			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, ...
with runs:
  (2,2), (1,1), (2,2), (1,1), (2,2), (1,1), (2), (1,1,1,1), (2,2), (1,1,1,1), ...
with lengths (A376680):
  2, 2, 2, 2, 2, 2, 1, 4, 2, 4, 1, 2, 2, 2, 1, 4, 1, 4, 2, 4, 1, 2, 2, 4, 1, 2, ...

These are the run-lengths of A073783, ones A375929.
For prime instead of composite we have A333254, first appearances A335406.
These are the first differences of A376603.
A000040 lists the prime numbers, first differences A001223, second differences A036263.
A002808 lists the composite numbers, differences A073783.
A064113 lists positions of adjacent equal prime gaps.
A073445 gives second differences of composite numbers, zeros A376602.
Cf. A054546, A076259, A174965, A251092, A376651, A376652.

Length/@Split[Differences[Select[Range[100],CompositeQ]]]

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.

A375926 Numbers k such that A018252(k+1) = A018252(k) + 1. In other words, the k-th nonprime number is 1 less than the next.

Original entry on oeis.org

4, 5, 8, 9, 12, 13, 15, 16, 17, 18, 21, 22, 23, 24, 26, 27, 30, 31, 33, 34, 35, 36, 38, 39, 40, 41, 44, 45, 46, 47, 49, 50, 53, 54, 55, 56, 58, 59, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 73, 74, 77, 78, 81, 82, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95

Offset: 1

Gus Wiseman, Sep 11 2024

nonn

			The nonprime numbers are 1, 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, ... which increase by 1 after term 4, term 5, term 8, etc.

The complement appears to be A014689, except the first term.
Positions of 1's in A065310 (see also A054546, A073783).
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 composite numbers is A375929.
A000040 lists the prime numbers, differences A001223.
A018252 lists the nonprimes, exclusive A002808.
A046933 counts composite numbers between primes.
Cf. A000961, A006549, A057820, A176246, A246655, A251092, A375708.

Join@@Position[Differences[Select[Range[100],!PrimeQ[#]&]],1]

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

A065311 Primes which occur exactly twice in the sequence of a(n) = prime(n) - prime(n - pi(n)) = A065308(n).

Original entry on oeis.org

3, 5, 13, 17, 29, 31, 43, 67, 71, 97, 107, 109, 131, 157, 181, 191, 223, 233, 239, 269, 281, 313, 359, 379, 383, 401, 409, 431, 503, 523, 569, 571, 619, 631, 659, 691, 719, 751, 787, 797, 857, 859, 881, 883, 971, 1039, 1061, 1063, 1091, 1117, 1123, 1201

Offset: 1

Labos Elemer, Oct 29 2001

nonn

In A065308, each odd prime seems to appear once or twice.

Harry J. Smith, Table of n, a(n) for n = 1..1000

Cf. A000040, A000720, A054546, A065308, A065309, A065310, A065311.

Most@ Select[Tally@ Array[Prime[# - PrimePi@ #] &, 300], Last@ # == 2 &][[All, 1]] (* Michael De Vlieger, Nov 03 2017 *)

{ n=0; p=1; f=2; m=1; for (i=1, 10^9, a=0; p=nextprime(p + 1); while (p==f, a++; m++; f=prime(m - primepi(m))); if (a==2, write("b065311.txt", n++, " ", p); if (n==1000, return)) ) } \\ Harry J. Smith, Oct 16 2009

A065312 Primes which occur exactly once in A065308 (prime(n - pi(n))).

Original entry on oeis.org

7, 11, 19, 23, 37, 41, 47, 53, 59, 61, 73, 79, 83, 89, 101, 103, 113, 127, 137, 139, 149, 151, 163, 167, 173, 179, 193, 197, 199, 211, 227, 229, 241, 251, 257, 263, 271, 277, 283, 293, 307, 311, 317, 331, 337, 347, 349, 353, 367, 373, 389, 397, 419, 421, 433

Offset: 1

Labos Elemer, Oct 29 2001

nonn

In A065308 each odd prime seems to appear once or twice. Prime 2 arises there 3 times.

Harry J. Smith, Table of n, a(n) for n = 1..1000

Cf. A000040, A000720, A054546, A065308, A065309, A065310, A065311.

With[{s = Array[Prime[# - PrimePi[#]] &, 120]}, Most@ Select[Split[s], Length@ # == 1 &][[All, 1]] ] (* Michael De Vlieger, Jun 19 2018 *)

{ n=0; p=1; f=2; m=1; for (i=1, 10^9, a=0; p=nextprime(p + 1); while (p==f, a++; m++; f=prime(m - primepi(m))); if (a==1, write("b065312.txt", n++, " ", p); if (n==1000, return)) ) } \\ Harry J. Smith, Oct 16 2009

A173400 n-th difference between consecutive primes=n-th difference between consecutive nonnegative nonprimes.

Original entry on oeis.org

1, 3, 7, 20, 26, 33, 43, 49, 52, 81, 116, 140, 176, 265, 288, 313, 320, 323, 373, 377, 395, 398, 405, 408, 486, 492, 530, 555, 567, 592, 671, 681, 772, 805, 849, 874, 884, 931, 936, 1016, 1030, 1149, 1204, 1324, 1347, 1406, 1464, 1550, 1621, 1639, 1707, 1712

Offset: 1

Juri-Stepan Gerasimov, Feb 17 2010

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

Cf. A001223, A075526, A173390, A173401, A029707.

A001223(a(n))=A054546(a(n)).

Extended by Charles R Greathouse IV, Mar 25 2010

cp's OEIS Frontend

A173401 Numbers k such that A075526(k-1) = A054546(k).

Views

Author

Keywords

Crossrefs

Programs

Maple

Extensions

A141468 Zero together with the nonprime numbers A018252.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A073445 Second differences of A002808, the sequence of composites.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Formula

A065310 Number of occurrences of n-th prime in A065308, where A065308(j) = prime(j - pi(j)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A376680 Run-lengths of first differences of composite numbers.

Views

Author

Keywords

Comments

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

A375926 Numbers k such that A018252(k+1) = A018252(k) + 1. In other words, the k-th nonprime number is 1 less than the next.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

Python

A065311 Primes which occur exactly twice in the sequence of a(n) = prime(n) - prime(n - pi(n)) = A065308(n).

Views

Author