A054735 -id:A054735 - cp's OEIS frontend

A134143 Let T(n) = (p, p+2) denote the n-th pair of twin primes. Let S(n) = 2p+2 (see A054735). Then a(n) = number of ways of writing S(n) as S(i) + S(j) with i <= j < m.

0, 0, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 3, 2, 3, 1, 4, 3, 3, 3, 2, 6, 3, 5, 3, 3, 3, 3, 3, 8, 4, 2, 3, 3, 6, 4, 4, 6, 7, 8, 3, 6, 3, 9, 8, 7, 7, 5, 8, 4, 1, 6, 6, 3, 7, 1, 6, 6, 4, 8, 1, 5, 5, 8, 9, 11, 10, 6, 8, 16, 13, 9, 12, 6, 7, 8, 4, 16, 9, 6, 13, 10, 9, 5, 6, 6, 8, 11, 16, 11, 13, 6, 6, 6, 17, 9, 6, 6, 4

Offset: 1

N. J. A. Sloane, Jan 25 2008

nonn

It is conjectured that a(n) > 0 for n >= 3.

			a(4) = 1 because S(4) = 17+19 = (5+7) + (11+13) = S(2)+S(3) and this is the only such way to write S(4) as the sum S(i) + S(j) for i <= j < 4.

R. K. Guy, ed., Unsolved Problems, Western Number Theory Meeting, Las Vegas, 1988.

Dmitry Kamenetsky, Table of n, a(n) for n = 1..10000 (terms 1..680 from James A. Sellers and R. J. Mathar)

Cf. A001359, A014574, A054735.

with(numtheory): Sset := {}; for i from 1 to 5000 do if ithprime(i + 1) - ithprime(i) = 2 then Sset := Sset union {2 ithprime(i) + 2} fi; od; Sset := convert(Sset, list): for n from 1 to nops(Sset) do count := 0: s := Sset[n]: for i from 1 to n do if member(s - Sset[i], Sset) and s - Sset[i] >= s/2 then count:=count + 1 fi: od: printf(`%d,`, count): od:# James Sellers, Jan 25 2008
A134143 := proc(n)
    local Sn, i, j, a;
    Sn := A054735(n);
    a := 0;
    for i from 1 to n-1 do
        for j from i to n-1 do
        if A054735(i)+A054735(j) = Sn then
            a := a+1;
        end if;
        end do:
    end do:
    a ;
end proc: # R. J. Mathar, Jan 25 2008

Terms a(5) onwards computed by James Sellers and R. J. Mathar, Jan 25 2008

A088525 Duplicate of A054735.

Original entry on oeis.org

8, 12, 24, 36, 60, 84, 120, 144, 204, 216, 276, 300, 360, 384, 396, 456, 480, 540, 564

Offset: 1

dead

A001359 Lesser of twin primes.

Original entry on oeis.org

3, 5, 11, 17, 29, 41, 59, 71, 101, 107, 137, 149, 179, 191, 197, 227, 239, 269, 281, 311, 347, 419, 431, 461, 521, 569, 599, 617, 641, 659, 809, 821, 827, 857, 881, 1019, 1031, 1049, 1061, 1091, 1151, 1229, 1277, 1289, 1301, 1319, 1427, 1451, 1481, 1487, 1607

Offset: 1

N. J. A. Sloane

Also, solutions to phi(n + 2) = sigma(n). - Conjectured by Jud McCranie, Jan 03 2001; proved by Reinhard Zumkeller, Dec 05 2002
The set of primes for which the weight as defined in A117078 is 3 gives this sequence except for the initial 3. - Rémi Eismann, Feb 15 2007
The set of lesser of twin primes larger than three is a proper subset of the set of primes of the form 3n - 1 (A003627). - Paul Muljadi, Jun 05 2008
It is conjectured that A113910(n+4) = a(n+2) for all n. - Creighton Dement, Jan 15 2009
I would like to conjecture that if f(x) is a series whose terms are x^n, where n represents the terms of sequence A001359, and if we inspect {f(x)}^5, the conjecture is that every term of the expansion, say a_n * x^n, where n is odd and at least equal to 15, has a_n >= 1. This is not true for {f(x)}^k, k = 1, 2, 3 or 4, but appears to be true for k >= 5. - Paul Bruckman (pbruckman(AT)hotmail.com), Feb 03 2009
A164292(a(n)) = 1; A010051(a(n) - 2) = 0 for n > 1. - Reinhard Zumkeller, Mar 29 2010
From Jonathan Sondow, May 22 2010: (Start)
About 15% of primes < 19000 are the lesser of twin primes. About 26% of Ramanujan primes A104272 < 19000 are the lesser of twin primes.
About 46% of primes < 19000 are Ramanujan primes. About 78% of the lesser of twin primes < 19000 are Ramanujan primes.
A reason for the jumps is in Section 7 of "Ramanujan primes and Bertrand's postulate" and in Section 4 of "Ramanujan Primes: Bounds, Runs, Twins, and Gaps". (End)
Primes generated by sequence A040976. - Odimar Fabeny, Jul 12 2010
Primes of the form 2*n - 3 with 2*n - 1 prime n > 2. Primes of the form (n^2 - (n-2)^2)/2 - 1 with (n^2 - (n-2)^2)/2 + 1 prime so sum of two consecutive odd numbers/2 - 1. - Pierre CAMI, Jan 02 2012
Conjecture: For any integers n >= m > 0, there are infinitely many integers b > a(n) such that the number Sum_{k=m..n} a(k)*b^(n-k) (i.e., (a(m), ..., a(n)) in base b) is prime; moreover, when m = 1 there is such an integer b < (n+6)^2. - Zhi-Wei Sun, Mar 26 2013
Except for the initial 3, all terms are congruent to 5 mod 6. One consequence of this is that no term of this sequence appears in A030459. - Alonso del Arte, May 11 2013
Aside from the first term, all terms have digital root 2, 5, or 8. - J. W. Helkenberg, Jul 24 2013
The sequence provides all solutions to the generalized Winkler conjecture (A051451) aside from all multiples of 6. Specifically, these solutions start from n = 3 as a(n) - 3. This gives 8, 14, 26, 38, 56, ... An example from the conjecture is solution 38 from twin prime pairs (3, 5), (41, 43). - Bill McEachen, May 16 2014
Conjecture: a(n)^(1/n) is a strictly decreasing function of n. Namely a(n+1)^(1/(n+1)) < a(n)^(1/n) for all n. This conjecture is true for all a(n) <= 1121784847637957. - Jahangeer Kholdi and Farideh Firoozbakht, Nov 21 2014
a(n) are the only primes, p(j), such that (p(j+m) - p(j)) divides (p(j+m) + p(j)) for some m > 0, where p(j) = A000040(j). For all such cases m=1. It is easy to prove, for j > 1, the only common factor of (p(j+m) - p(j)) and (p(j+m) + p(j)) is 2, and there are no common factors if j = 1. Thus, p(j) and p(j+m) are twin primes. Also see A067829 which includes the prime 3. - Richard R. Forberg, Mar 25 2015
Primes prime(k) such that prime(k)! == 1 (mod prime(k+1)) with the exception of prime(991) = 7841 and other unknown primes prime(k) for which (prime(k)+1)*(prime(k)+2)*...*(prime(k+1)-2) == 1 (mod prime(k+1)) where prime(k+1) - prime(k) > 2. - Thomas Ordowski and Robert Israel, Jul 16 2016
For the twin prime criterion of Clement see the link. In Ribenboim, pp. 259-260 a more detailed proof is given. - Wolfdieter Lang, Oct 11 2017
Conjecture: Half of the twin prime pairs can be expressed as 8n + M where M > 8n and each value of M is a distinct composite integer with no more than two prime factors. For example, when n=1, M=21 as 8 + 21 = 29, the lesser of a twin prime pair. - Martin Michael Musatov, Dec 14 2017
For a discussion of bias in the distribution of twin primes, see my article on the Vixra web site. - Waldemar Puszkarz, May 08 2018
Since 2^p == 2 (mod p) (Fermat's little theorem), these are primes p such that 2^p == q (mod p), where q is the next prime after p. - Thomas Ordowski, Oct 29 2019, edited by M. F. Hasler, Nov 14 2019
The yet unproved "Twin Prime Conjecture" states that this sequence is infinite. - M. F. Hasler, Nov 14 2019
Lesser of the twin primes are the set of elements that occur in both A162566, A275697. Proof: A prime p will only have integer solutions to both (p+1)/g(p) and (p-1)/g(p) when p is the lesser of a twin prime, where g(p) is the gap between p and the next prime, because gcd(p+1,p-1) = 2. - Ryan Bresler, Feb 14 2021
From Lorenzo Sauras Altuzarra, Dec 21 2021: (Start)
J. A. Hervás Contreras observed the subsequence 11, 311, 18311, 1518311, 421518311... (see the links), which led me to conjecture the following statements.
I. If i is an integer greater than 2, then there exist positive integers j and k such that a(j) equals the concatenation of 3k and a(i).
II. If k is a positive integer, then there exist positive integers i and j such that a(j) equals the concatenation of 3k and a(i).
III. If i, j, and r are positive integers such that i > 2 and a(j) equals the concatenation of r and a(i), then 3 divides r. (End)

Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 6.
Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §3.2 Prime Numbers, p. 81.
Paulo Ribenboim, The New Book of Prime Number Records, Springer-Verlag NY 1996, pp. 259-260.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 192-197.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 111-112.

Chris K. Caldwell, Table of n, a(n) for n = 1..100000
Milton Abramowitz and Irene A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Abhinav Aggarwal, Zekun Xu, Oluwaseyi Feyisetan, and Nathanael Teissier, On Primes, Log-Loss Scores and (No) Privacy, arXiv:2009.08559 [cs.LG], 2020.
Chris K. Caldwell, First 100000 Twin Primes
Chris K. Caldwell, Twin Primes
Chris K. Caldwell, Largest known twin primes
Chris K. Caldwell, Twin primes
Chris K. Caldwell, The prime pages
P. A. Clement, Congruences for sets of primes, American Mathematical Monthly, vol. 56,1 (1949), 23-25.
Harvey Dubner, Twin Prime Statistics, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.2.
Andrew Granville and Greg Martin, Prime number races, arXiv:math/0408319 [math.NT], 2004; Amer. Math. Monthly, 113 (No. 1, 2006), 1-33.
José Antonio Hervás Contreras, ¿Nueva propiedad de los primos gemelos?
Thomas R. Nicely, Some Results of Computational Research in Prime Numbers [See local copy in A007053]
Thomas R. Nicely, Enumeration to 10^14 of the twin primes and Brun's constant, Virginia Journal of Science, 46:3 (Fall, 1995), 195-204.
Thomas R. Nicely, Enumeration to 10^14 of the twin primes and Brun's constant [Local copy, pdf only]
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Waldemar Puszkarz, Statistical Bias in the Distribution of Prime Pairs and Isolated Primes, vixra:1804.0416 (2018).
Fred Richman, Generating primes by the sieve of Eratosthenes
Maxie D. Schmidt, New Congruences and Finite Difference Equations for Generalized Factorial Functions, arXiv:1701.04741 [math.CO], 2017.
P. Shiu, A Diophantine Property Associated with Prime Twins, Experimental mathematics 14 (1) (2005).
Jonathan Sondow, Ramanujan primes and Bertrand's postulate, arXiv:0907.5232 [math.NT], 2009-2010; Amer. Math. Monthly, 116 (2009) 630-635.
Jonathan Sondow, J. W. Nicholson, and T. D. Noe, Ramanujan Primes: Bounds, Runs, Twins, and Gaps, arXiv:1105.2249 [math.NT], 2011; J. Integer Seq. 14 (2011) Article 11.6.2.
Jonathan Sondow and Emmanuel Tsukerman, The p-adic order of power sums, the Erdos-Moser equation, and Bernoulli numbers, arXiv:1401.0322 [math.NT], 2014; see section 4.
Terence Tao, Obstructions to uniformity and arithmetic patterns in the primes, arXiv:math/0505402 [math.NT], 2005.
Apoloniusz Tyszka, On sets X subset of N for which we know an algorithm that computes a threshold number t(X) in N such that X is infinite if and only if X contains an element greater than t(X), 2019.
Eric Weisstein's World of Mathematics, Twin Primes
Index entries for primes, gaps between

Subsequence of A003627.
Cf. A001223, A006512 (greater of twin primes), A014574, A001097, A077800, A002822, A040040, A054735, A067829, A082496, A088328, A117078, A117563, A074822, A071538, A007508, A146214, A350246, A350247.
Cf. A104272 (Ramanujan primes), A178127 (lesser of twin Ramanujan primes), A178128 (lesser of twin primes if it is a Ramanujan prime).
Cf. A010051, A000040.

a001359 n = a001359_list !! (n-1)
a001359_list = filter ((== 1) . a010051' . (+ 2)) a000040_list
-- Reinhard Zumkeller, Feb 10 2015

[n: n in PrimesUpTo(1610) | IsPrime(n+2)];  // Bruno Berselli, Feb 28 2011

select(k->isprime(k+2),select(isprime,[$1..1616])); # Peter Luschny, Jul 21 2009
A001359 := proc(n)
   option remember;
   if n = 1
      then 3;
   else
      p := nextprime(procname(n-1)) ;
      while not isprime(p+2) do
         p := nextprime(p) ;
      end do:
      p ;
   end if;
end proc: # R. J. Mathar, Sep 03 2011

Select[Prime[Range[253]], PrimeQ[# + 2] &] (* Robert G. Wilson v, Jun 09 2005 *)
a[n_] := a[n] = (p = NextPrime[a[n - 1]]; While[!PrimeQ[p + 2], p = NextPrime[p]]; p); a[1] = 3; Table[a[n], {n, 51}]  (* Jean-François Alcover, Dec 13 2011, after R. J. Mathar *)
nextLesserTwinPrime[p_Integer] := Block[{q = p + 2}, While[NextPrime@ q - q > 2, q = NextPrime@ q]; q]; NestList[nextLesserTwinPrime@# &, 3, 50] (* Robert G. Wilson v, May 20 2014 *)
Select[Partition[Prime[Range[300]],2,1],#[[2]]-#[[1]]==2&][[All,1]] (* Harvey P. Dale, Jan 04 2021 *)
q = Drop[Prepend[p = Prime[Range[100]], 2], -1];
Flatten[q[[#]] & /@ Position[p - q, 2]] (* Horst H. Manninger, Mar 28 2021 *)

A001359(n,p=3) = { while( p+2 < (p=nextprime( p+1 )) || n-->0,); p-2}
/* The following gives a reasonably good estimate for any value of n from 1 to infinity; compare to A146214. */
A001359est(n) = solve( x=1,5*n^2/log(n+1), 1.320323631693739*intnum(t=2.02,x+1/x,1/log(t)^2)-log(x) +.5 - n)
/* The constant is A114907; the expression in front of +.5 is an estimate for A071538(x) */ \\  M. F. Hasler, Dec 10 2008

from sympy import primerange, isprime
print([n for n in primerange(1, 2001) if isprime(n + 2)]) # Indranil Ghosh, Jul 20 2017

a(n) = A077800(2n-1).
A001359 = { n | A071538(n-1) = A071538(n)-1 }; A071538(A001359(n)) = n. - M. F. Hasler, Dec 10 2008
A001359 = { prime(n) : A069830(n) = A087454(n) }. - Juri-Stepan Gerasimov, Aug 23 2011
a(n) = prime(A029707(n)). - R. J. Mathar, Feb 19 2017

A014574 Average of twin prime pairs.

Original entry on oeis.org

4, 6, 12, 18, 30, 42, 60, 72, 102, 108, 138, 150, 180, 192, 198, 228, 240, 270, 282, 312, 348, 420, 432, 462, 522, 570, 600, 618, 642, 660, 810, 822, 828, 858, 882, 1020, 1032, 1050, 1062, 1092, 1152, 1230, 1278, 1290, 1302, 1320, 1428, 1452, 1482, 1488, 1608

Offset: 1

R. K. Guy, N. J. A. Sloane, Eric W. Weisstein

With an initial 1 added, this is the complement of the closure of {2} under a*b+1 and a*b-1. - Franklin T. Adams-Watters, Jan 11 2006
Also the square root of the product of twin prime pairs + 1. Two consecutive odd numbers can be written as 2k+1,2k+3. Then (2k+1)(2k+3)+1 = 4(k^2+2k+1) = 4(k+1)^2, a perfect square. Since twin prime pairs are two consecutive odd numbers, the statement is true for all twin prime pairs. - Cino Hilliard, May 03 2006
Or, single (or isolated) composites. Nonprimes k such that neither k-1 nor k+1 is nonprime. - Juri-Stepan Gerasimov, Aug 11 2009
Numbers n such that sigma(n-1) = phi(n+1). - Farideh Firoozbakht, Jul 04 2010
Aside from the first term in the sequence, all remaining terms have digital root 3, 6, or 9. - J. W. Helkenberg, Jul 24 2013
Numbers n such that n^2-1 is a semiprime. - Thomas Ordowski, Sep 24 2015
Every term but the first is a multiple of 6. - Harvey P. Dale, Mar 31 2023

Archimedeans Problems Drive, Eureka, 30 (1967).

T. D. Noe, Table of n, a(n) for n = 1..10000
C. K. Caldwell, The Prime Glossary: Twin primes
C. K. Caldwell, The Top Twenty: Twin Primes
Y. Fujiwara, Parsing a Sequence of Qubits, IEEE Trans. Information Theory, 59 (2013), 6796-6806.
Y. Fujiwara, Parsing a Sequence of Qubits, arXiv:1207.1138 [quant-ph], 2012-2013.
L. J. Gerstein, A reformulation of the Goldbach conjecture, Math. Mag., 66 (1993), 44-45.
Brian Hayes, Does having prime neighbors make you more composite?, Bit-Player Article, Nov 04 2021
Eric Weisstein's World of Mathematics, Twin Primes

Cf. A000010, A000203, A001359, A002822, A006512, A037074, A040040, A054735, A077800, A111046.

A068507 is the intersection of A002182 and this sequence.

a:=1+Filtered([1..2000],p->IsPrime(p) and IsPrime(p+2)); # Muniru A Asiru, May 20 2018

a014574 n = a014574_list !! (n-1)
a014574_list = [x | x <- [2,4..], a010051 (x-1) == 1, a010051 (x+1) == 1]
-- Reinhard Zumkeller, Apr 11 2012

P := select(isprime,[$1..1609]): map(p->p+1,select(p->member(p+2,P),P)); # Peter Luschny, Mar 03 2011
A014574 := proc(n) option remember; local p ; if n = 1 then 4 ; else p := nextprime( procname(n-1) ) ; while not isprime(p+2) do p := nextprime(p) ; od ; return p+1 ; end if ; end proc: # R. J. Mathar, Jun 11 2011

Select[Table[Prime[n] + 1, {n, 260}], PrimeQ[ # + 1] &] (* Ray Chandler, Oct 12 2005 *)
Mean/@Select[Partition[Prime[Range[300]],2,1],Last[#]-First[#]==2&] (* Harvey P. Dale, Jan 16 2014 *)

A014574(n) := block(
    if n = 1 then
        return(4),
    p : A014574(n-1) ,
    for k : 2 step 2 do (
        if primep(p+k-1) and primep(p+k+1) then
            return(p+k)
    )
)$ /* R. J. Mathar, Mar 15 2012 */

p=2;forprime(q=3,1e4,if(q-p==2,print1(p+1", "));p=q) \\ Charles R Greathouse IV, Jun 10 2011

a(n) = (A001359(n) + A006512(n))/2 = 2*A040040(n) = A054735(n)/2 = A111046(n)/4.
a(n) = A129297(n+4). - Reinhard Zumkeller, Apr 09 2007
A010051(a(n) - 1) * A010051(a(n) + 1) = 1. Reinhard Zumkeller, Apr 11 2012
a(n) = 6*A002822(n-1), n>=2. - Ivan N. Ianakiev, Aug 19 2013
a(n)^4 - 4*a(n)^2 = A062354(a(n)^2 - 1). - Raphie Frank, Oct 17 2013

Offset changed to 1 by R. J. Mathar, Jun 11 2011

A262626 Visible parts of the perspective view of the stepped pyramid whose structure essentially arises after the 90-degree-zig-zag folding of the isosceles triangle A237593.

Original entry on oeis.org

1, 1, 1, 3, 2, 2, 2, 2, 2, 1, 1, 2, 7, 3, 1, 1, 3, 3, 3, 3, 2, 2, 3, 12, 4, 1, 1, 1, 1, 4, 4, 4, 4, 2, 1, 1, 2, 4, 15, 5, 2, 1, 1, 2, 5, 5, 3, 5, 5, 2, 2, 2, 2, 5, 9, 9, 6, 2, 1, 1, 1, 1, 2, 6, 6, 6, 6, 3, 1, 1, 1, 1, 3, 6, 28, 7, 2, 2, 1, 1, 2, 2, 7, 7, 7, 7, 3, 2, 1, 1, 2, 3, 7, 12, 12, 8, 3, 1, 2, 2, 1, 3, 8, 8, 8, 8, 8, 3, 2, 1, 1

Offset: 1

Omar E. Pol, Sep 26 2015

Also the rows of both triangles A237270 and A237593 interleaved.
Also, irregular triangle read by rows in which T(n,k) is the area of the k-th region (from left to right in ascending diagonal) of the n-th symmetric set of regions (from the top to the bottom in descending diagonal) in the two-dimensional diagram of the perspective view of the infinite stepped pyramid described in A245092 (see the diagram in the Links section).
The diagram of the symmetric representation of sigma is also the top view of the pyramid, see Links section. For more information about the diagram see also A237593 and A237270.
The number of cubes at the n-th level is also A024916(n), the sum of all divisors of all positive integers <= n.
Note that this pyramid is also a quarter of the pyramid described in A244050. Both pyramids have infinitely many levels.
Odd-indexed rows are also the rows of the irregular triangle A237270.
Even-indexed rows are also the rows of the triangle A237593.
Lengths of the odd-indexed rows are in A237271.
Lengths of the even-indexed rows give 2*A003056.
Row sums of the odd-indexed rows gives A000203, the sum of divisors function.
Row sums of the even-indexed rows give the positive even numbers (see A005843).
Row sums give A245092.
From the front view of the stepped pyramid emerges a geometric pattern which is related to A001227, the number of odd divisors of the positive integers.
The connection with the odd divisors of the positive integers is as follows: A261697 --> A261699 --> A237048 --> A235791 --> A237591 --> A237593 --> A237270 --> this sequence.

			Irregular triangle begins:
  1;
  1, 1;
  3;
  2, 2;
  2, 2;
  2, 1, 1, 2;
  7;
  3, 1, 1, 3;
  3, 3;
  3, 2, 2, 3;
  12;
  4, 1, 1, 1, 1, 4;
  4, 4;
  4, 2, 1, 1, 2, 4;
  15;
  5, 2, 1, 1, 2, 5;
  5, 3, 5;
  5, 2, 2, 2, 2, 5;
  9, 9;
  6, 2, 1, 1, 1, 1, 2, 6;
  6, 6;
  6, 3, 1, 1, 1, 1, 3, 6;
  28;
  7, 2, 2, 1, 1, 2, 2, 7;
  7, 7;
  7, 3, 2, 1, 1, 2, 3, 7;
  12, 12;
  8, 3, 1, 2, 2, 1, 3, 8;
  8, 8, 8;
  8, 3, 2, 1, 1, 1, 1, 2, 3, 8;
  31;
  9, 3, 2, 1, 1, 1, 1, 2, 3, 9;
  ...
Illustration of the odd-indexed rows of triangle as the diagram of the symmetric representation of sigma which is also the top view of the stepped pyramid:
.
   n  A000203    A237270    _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
   1     1   =      1      |_| | | | | | | | | | | | | | | |
   2     3   =      3      |_ _|_| | | | | | | | | | | | | |
   3     4   =    2 + 2    |_ _|  _|_| | | | | | | | | | | |
   4     7   =      7      |_ _ _|    _|_| | | | | | | | | |
   5     6   =    3 + 3    |_ _ _|  _|  _ _|_| | | | | | | |
   6    12   =     12      |_ _ _ _|  _| |  _ _|_| | | | | |
   7     8   =    4 + 4    |_ _ _ _| |_ _|_|    _ _|_| | | |
   8    15   =     15      |_ _ _ _ _|  _|     |  _ _ _|_| |
   9    13   =  5 + 3 + 5  |_ _ _ _ _| |      _|_| |  _ _ _|
  10    18   =    9 + 9    |_ _ _ _ _ _|  _ _|    _| |
  11    12   =    6 + 6    |_ _ _ _ _ _| |  _|  _|  _|
  12    28   =     28      |_ _ _ _ _ _ _| |_ _|  _|
  13    14   =    7 + 7    |_ _ _ _ _ _ _| |  _ _|
  14    24   =   12 + 12   |_ _ _ _ _ _ _ _| |
  15    24   =  8 + 8 + 8  |_ _ _ _ _ _ _ _| |
  16    31   =     31      |_ _ _ _ _ _ _ _ _|
  ...
The above diagram arises from a simpler diagram as shown below.
Illustration of the even-indexed rows of triangle as the diagram of the deployed front view of the corner of the stepped pyramid:
.
.                                 A237593
Level                               _ _
1                                 _|1|1|_
2                               _|2 _|_ 2|_
3                             _|2  |1|1|  2|_
4                           _|3   _|1|1|_   3|_
5                         _|3    |2 _|_ 2|    3|_
6                       _|4     _|1|1|1|1|_     4|_
7                     _|4      |2  |1|1|  2|      4|_
8                   _|5       _|2 _|1|1|_ 2|_       5|_
9                 _|5        |2  |2 _|_ 2|  2|        5|_
10              _|6         _|2  |1|1|1|1|  2|_         6|_
11            _|6          |3   _|1|1|1|1|_   3|          6|_
12          _|7           _|2  |2  |1|1|  2|  2|_           7|_
13        _|7            |3    |2 _|1|1|_ 2|    3|            7|_
14      _|8             _|3   _|1|2 _|_ 2|1|_   3|_             8|_
15    _|8              |3    |2  |1|1|1|1|  2|    3|              8|_
16   |9                |3    |2  |1|1|1|1|  2|    3|                9|
...
The number of horizontal line segments in the n-th level in each side of the diagram equals A001227(n), the number of odd divisors of n.
The number of horizontal line segments in the left side of the diagram plus the number of the horizontal line segment in the right side equals A054844(n).
The total number of vertical line segments in the n-th level of the diagram equals A131507(n).
The diagram represents the first 16 levels of the pyramid.
The diagram of the isosceles triangle and the diagram of the top view of the pyramid shows the connection between the partitions into consecutive parts and the sum of divisors function (see also A286000 and A286001). - _Omar E. Pol_, Aug 28 2018
The connection between the isosceles triangle and the stepped pyramid is due to the fact that this object can also be interpreted as a pop-up card. - _Omar E. Pol_, Nov 09 2022

Robert Price, Table of n, a(n) for n = 1..16048 (n=1..412 rows)
Omar E. Pol, An infinite stepped pyramid (A237593, A237270, A262626)
Omar E. Pol, Diagram of the isosceles triangle A237593 before the 90-degree-zig-zag folding (rows: 1..28)
Omar E. Pol, Perspective view of the stepped pyramid (levels: 1..16)
Index entries for sequences related to sigma(n)

Famous sequences that are visible in the stepped pyramid:
Cf. A000040 (prime numbers)......., for the characteristic shape see A346871.
Cf. A000079 (powers of 2)........., for the characteristic shape see A346872.
Cf. A000203 (sum of divisors)....., total area of the terraces in the n-th level.
Cf. A000217 (triangular numbers).., for the characteristic shape see A346873.
Cf. A000225 (Mersenne numbers)...., for a visualization see A346874.
Cf. A000384 (hexagonal numbers)..., for the characteristic shape see A346875.
Cf. A000396 (perfect numbers)....., for the characteristic shape see A346876.
Cf. A000668 (Mersenne primes)....., for a visualization see A346876.
Cf. A001097 (twin primes)........., for a visualization see A346871.
Cf. A001227 (# of odd divisors)..., number of subparts in the n-th level.
Cf. A002378 (oblong numbers)......, for a visualization see A346873.
Cf. A008586 (multiples of 4)......, perimeters of the successive levels.
Cf. A008588 (multiples of 6)......, for the characteristic shape see A224613.
Cf. A013661 (zeta(2))............., (area of the horizontal faces)/(n^2), n -> oo.
Cf. A014105 (second hexagonals)..., for the characteristic shape see A346864.
Cf. A067742 (# of middle divisors), # cells in the main diagonal in n-th level.
Other sequences that are visible in the stepped pyramid: A000096, A001065, A001359, A001747, A002939, A002943, A003056, A004125, A004277, A004526, A005279, A006512, A007606, A007607, A082647, A008438, A008578, A008864, A010814, A014106, A014107, A014132, A014574, A016945, A019434, A024206, A024916, A028552, A028982, A028983, A034856, A038550, A047836, A048050, A052928, A054735, A054844, A062731, A065091, A065475, A071561, A071562, A071904, A092506, A100484, A108605, A139256, A139257, A144396, A152677, A152678, A153485, A155085, A161680, A161983, A162917, A174905, A174973, A175254, A176810, A224880, A235791, A237270, A237271, A237591, A237593, A238005, A238524, A244049, A245092, A259176, A259177, A261348, A278972, A317302, A317303, A317304, A317305, A317307, A319529, A319796, A319801, A319802, A327329, A336305, (and several others).
Apart from zeta(2) other constants that are related to the stepped pyramid are A072691, A353908, A354238.
Cf. A054844, A131507, A196020, A236104, A237048, A239660, A244050, A259179, A261350, A261697, A261699, A262612, A280850, A286000, A286001, A296508.

A040040 Average of twin prime pairs (A014574), divided by 2. Equivalently, 2a(n)-1 and 2a(n)+1 are primes.

Original entry on oeis.org

2, 3, 6, 9, 15, 21, 30, 36, 51, 54, 69, 75, 90, 96, 99, 114, 120, 135, 141, 156, 174, 210, 216, 231, 261, 285, 300, 309, 321, 330, 405, 411, 414, 429, 441, 510, 516, 525, 531, 546, 576, 615, 639, 645, 651, 660, 714, 726, 741, 744, 804, 810, 834, 849, 861, 894

Offset: 1

N. J. A. Sloane

Intersection of A005097 and A006254. - Zak Seidov, Mar 18 2005
The only possible pairs for 2a(n)+-1 are prime/prime (this sequence), not prime/not prime (A104278), prime/notprime (A104279) and not prime/prime (A104280), ... this sequence + A104280 + A104279 + A104278 = the odd numbers.
These numbers are never k mod (2k+1) or (k+1) mod (2k+1) with 2k+1 < a(n). - Jon Perry, Sep 04 2012
Excluding the first term, all remaining terms have digital root 3, 6 or 9. - J. W. Helkenberg, Jul 24 2013
Positive numbers x such that the difference between x^2 and adjacent squares are prime (both x^2-(x-1)^2 and (x+1)^2-x^2 are prime). - Doug Bell, Aug 21 2015

T. D. Noe, Table of n, a(n) for n = 1..10001

Cf. A001359, A006512, A014574, A054735, A111046, A045753 (even terms halved), A002822 (terms divided by 3).
Cf. A221310.
Cf. A260689, A264526.

a040040 = flip div 2 . a014574  -- Reinhard Zumkeller, Nov 17 2015

P := select(isprime,[$1..1789]): map(p->(p+1)/2, select(p->member(p+2,P),P)); # Peter Luschny, Mar 03 2011

Select[Range[900], And @@ PrimeQ[{-1, 1} + 2# ] &] (* Ray Chandler, Oct 12 2005 *)

p=2; forprime(b=3, 1e4, if(b-p==2, print1((p+1)/2", ")); p=b) \\ Altug Alkan, Nov 10 2015

a(n) = A014574(n)/2 = A054735(n+1)/4 = A111046(n+1)/8.
For n > 1, a(n) = 3*A002822(n-1). - Jason Kimberley, Nov 06 2015
A260689(a(n),1) = A264526(a(n)) = 1. - Reinhard Zumkeller, Nov 17 2015
From Michael G. Kaarhus, Aug 19 2022: (Start)
a(n) = (A001359(n) + 1)/2.
a(n) = (A006512(n) - 1)/2.
For n > 1, a(n) = A167379(n-1) * 3/2. (End)

More terms from Cino Hilliard, Oct 21 2002
Title corrected by Daniel Forgues, Jun 01 2009
Edited by Daniel Forgues, Jun 21 2009
Comment corrected by Daniel Forgues, Jul 12 2009

A373406 Sum of the n-th maximal run of odd primes differing by two.

Original entry on oeis.org

15, 24, 36, 23, 60, 37, 84, 47, 53, 120, 67, 144, 79, 83, 89, 97, 204, 216, 113, 127, 131, 276, 300, 157, 163, 167, 173, 360, 384, 396, 211, 223, 456, 233, 480, 251, 257, 263, 540, 277, 564, 293, 307, 624, 317, 331, 337, 696, 353, 359, 367, 373, 379, 383

Offset: 1

Gus Wiseman, Jun 05 2024

nonn

The length of this run is given by A251092.
For this sequence we define a run to be an interval of positions at which consecutive terms differ by two. Normally, a run has consecutive terms differing by one, but odd prime numbers already differ by at least two.
Contains A054735 (sums of twin prime pairs) without its first two terms and A007510 (non-twin primes) as subsequences. - R. J. Mathar, Jun 07 2024

			Row-sums of:
   3   5   7
  11  13
  17  19
  23
  29  31
  37
  41  43
  47
  53
  59  61
  67
  71  73
  79
  83
  89
  97

Gus Wiseman, Four statistics for runs and antiruns of prime, nonprime, squarefree, and nonsquarefree numbers

The partial sums are a subset of A071148 (partial sums of odd primes).
Functional neighbors: A025584, A054265, A067774, A251092 (or A175632), A373405, A373413, A373414.
A000040 lists the primes, differences A001223.
A046933 counts composite numbers between primes.
A065855 counts composite numbers up to n.
Cf. A005117, A007053, A029707, A038664, A293697, A350842, A371201.

Total/@Split[Select[Range[3,100],PrimeQ],#1+2==#2&]//Most

A105571 Numbers m such that m - 2 and m + 2 are semiprimes.

Original entry on oeis.org

8, 12, 23, 24, 36, 37, 53, 60, 67, 84, 89, 93, 113, 117, 120, 121, 131, 143, 144, 157, 185, 203, 204, 207, 211, 215, 216, 217, 219, 251, 276, 289, 293, 297, 300, 301, 303, 307, 321, 325, 337, 360, 363, 379, 384, 393, 396, 405, 409, 413, 415, 449, 456, 471, 480

Offset: 1

Reinhard Zumkeller, Apr 14 2005

nonn

A001222(a(n)-2) = A001222(a(n)+2) = 2.
The even members of the sequence are A054735. - Robert Israel, Jan 18 2015
The prime members of the sequence are A063643. - Michel Marcus, Mar 27 2015

			From _Jon E. Schoenfield_, Jan 18 2015: (Start)
12 - 2 = 10 = 2*5 and 12 + 2 = 14 = 2*7 so 12 is in the sequence.
23 - 2 = 21 = 3*7 and 23 + 2 = 25 = 5*5 so 23 is in the sequence.
16 - 2 = 14 = 2*7 but 16 + 2 = 18 = 2*3*3 so 16 is not in the sequence.
(End)

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

Cf. A014574, A054735, A063643, A105572, A105573.

Cf. A064911.

a105571 n = a105571_list !! (n-1)
a105571_list = [x | x <- [3..], a064911 (x - 2) == 1, a064911 (x + 2) == 1]
-- Reinhard Zumkeller, Mar 31 2015

IsSemiprime:=func< n | &+[k[2]: k in Factorization(n)] eq 2 >; [ n: n in [3..700] | IsSemiprime(n+2) and IsSemiprime(n-2) ]; // Vincenzo Librandi, Mar 30 2015

select(n -> numtheory:-bigomega(n+2) = 2 and numtheory:-bigomega(n-2) = 2,
[$1..1000]); # Robert Israel, Jan 18 2015

q=2;lst={};Do[If[Plus@@Last/@FactorInteger[n-q]==q&&Plus@@Last/@FactorInteger[n+q]==q,AppendTo[lst,n]],{n,7!}];lst (* Vladimir Joseph Stephan Orlovsky, Feb 01 2009 *)
Select[Range[700], PrimeOmega[# + 2] == PrimeOmega[# - 2] == 2 &] (* Vincenzo Librandi, Mar 30 2015 *)

A051779 Primes of form pq + 2 where p and q are twin primes.

Original entry on oeis.org

17, 37, 22501, 32401, 57601, 72901, 176401, 324901, 1664101, 1742401, 5336101, 6502501, 7452901, 11289601, 11492101, 18147601, 21622501, 34222501, 34574401, 40449601, 45968401, 81000001, 85377601, 92736901, 110880901, 118592101

Offset: 1

Joe DeMaio (jdemaio(AT)kennesaw.edu), Dec 09 1999

Starting with 3rd term, 22501, all terms are of the form 900n^2+1 with n=5, 6, 8, 9, 14, 19, 43, 44, 77, 85 (A125251). - Zak Seidov, Dec 07 2008

Primes of the form (p^2 + q^2)/2, where p and q are twin primes. - Thomas Ordowski and Altug Alkan, Mar 19 2017

			The third term 22501 is a member of the sequence because 22501=149*151+2, 22501 is prime and {149,151} is a twin prime pair.

Giovanni Resta, Table of n, a(n) for n = 1..10000

Cf. A048880, A051779, A000040, A001359, A005384, A006512, A037074, A054735.

Cf. A125251. - Zak Seidov, Dec 07 2008

with (numtheory): for n from 1 to 2000 do if (ithprime(n+1)-ithprime(n)=2) then if (tau(ithprime(n)*ithprime(n+1)+2)=2) then print(ithprime(n),ithprime(n+1), ithprime(n)*ithprime(n+1)+2); fi; fi; od;

lst={};Do[p=Prime[n];If[Length[Divisors[p-2]]==4&&(Divisors[p-2][[3]]-Divisors[p-2][[2]])==2, AppendTo[lst, p]], {n, 6*10^5}];lst (* Vladimir Joseph Stephan Orlovsky, Aug 08 2008 *)
Select[(First[#]Last[#]+2)&/@Select[Partition[Prime[Range[2700]], 2,1], Last[#]-First[#]==2&],PrimeQ]  (* Harvey P. Dale, Mar 11 2011 *)
Select[2 + Times @@@ Select[ Partition[ Prime@ Range@ 1350, 2, 1], First[#] + 2 == Last[#] &], PrimeQ] (* Robert G. Wilson v, Mar 12 2001 *)

{A037074(k) + 2} INTERSECT {A000040}. {A001359(k) * A006512(k) + 2} INTERSECT {A000040}. {A054735(k)^2 + 2*A054735(k) + 2} INTERSECT {A000040}. - Jonathan Vos Post, May 11 2006

Edited by R. J. Mathar, Aug 08 2008

A111046 Difference between squares of twin prime pairs.

Original entry on oeis.org

16, 24, 48, 72, 120, 168, 240, 288, 408, 432, 552, 600, 720, 768, 792, 912, 960, 1080, 1128, 1248, 1392, 1680, 1728, 1848, 2088, 2280, 2400, 2472, 2568, 2640, 3240, 3288, 3312, 3432, 3528, 4080, 4128, 4200, 4248, 4368, 4608, 4920, 5112, 5160, 5208, 5280

Offset: 1

Giovanni Teofilatto, Oct 06 2005

Except for the first term 16 = 4^2, a(n) is never a square.

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

Cf. A001359, A006512, A014574, A040040, A054735, A108570, A108604.

a111046 = (* 2) . a054735  -- Reinhard Zumkeller, Feb 10 2015

ZL:=[]:for p from 1 to 1400 do if (isprime(p) and isprime(p+2)) then ZL:=[op(ZL),(((p+2)^2)-p^2)]; fi; od; print(ZL); # Zerinvary Lajos, Mar 08 2007

Select[Table[Prime[n] + 1, {n, 220}], PrimeQ[ # + 1] &] *4 (* Ray Chandler, Oct 12 2005 *)
4+4#&/@Select[Partition[Prime[Range[300]],2,1],#[[2]]-#[[1]]==2&] [[All,1]] (* Harvey P. Dale, Apr 12 2018 *)

a(n) = A006512(n)^2 - A001359(n)^2 = A108604(n) - A108570(n) = 2*A054735(n) = 4*A014574(n) = 8*A040040(n).

Edited and extended by Ray Chandler, Oct 12 2005

cp's OEIS Frontend

A134143 Let T(n) = (p, p+2) denote the n-th pair of twin primes. Let S(n) = 2p+2 (see A054735). Then a(n) = number of ways of writing S(n) as S(i) + S(j) with i <= j < m.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Extensions

A088525 Duplicate of A054735.

Views

Author

Keywords

A001359 Lesser of twin primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A014574 Average of twin prime pairs.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Maple

Mathematica

Maxima

PARI

Formula

Extensions

A262626 Visible parts of the perspective view of the stepped pyramid whose structure essentially arises after the 90-degree-zig-zag folding of the isosceles triangle A237593.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A040040 Average of twin prime pairs (A014574), divided by 2. Equivalently, 2*a(n)-1 and 2*a(n)+1 are primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Formula

Extensions

A373406 Sum of the n-th maximal run of odd primes differing by two.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A040040 Average of twin prime pairs (A014574), divided by 2. Equivalently, 2a(n)-1 and 2a(n)+1 are primes.