cp's OEIS Frontend

All terms are == 1 (mod 8). For n > 2, a(n) == 1 (mod 120).

This sequence is a subsequence of A247687 and it contains the squares of all those primes p for which the areas of the 3 regions in the symmetric representation of p^2 (p once and (p^2 + 1)/2 twice), are primes; i.e., p^2 and p^2 + 1 are semiprimes (see A070552). The sequence of those primes p is A048161. Cf. A237593. - Hartmut F. W. Hoft, Aug 06 2020

Primes which are a leg of an integral right triangle whose hypotenuse is also prime.

It is conjectured that there are an infinite number of such triangles.

The Pythagorean triple {p, (p^2 - 1)/2, (p^2 + 1)/2} corresponds to {a(n), A067755(n), A067756(n)}. - Lekraj Beedassy, Oct 27 2003

There is no Pythagorean triangle all of whose sides are prime numbers. Still there are Pythagorean triangles of which the hypotenuse and one side are prime numbers, for example, the triangles (3,4,5), (11,60,61), (19,180,181), (61,1860,1861), (71,2520,2521), (79,3120,3121). [Sierpiński]

We can always write p=(Y+1)^2-Y^2, with Y=(p-1)/2, therefore q=(Y+1)^2+Y^2. - Vincenzo Librandi, Nov 19 2010

p^2 and p^2+1 are semiprimes; p^2 are squares in A070552 Numbers n such that n and n+1 are products of two primes. - Zak Seidov, Mar 21 2011

Each term is the beginning of a run of three 2-almost primes (semiprimes). No runs exist of length greater than three. For the same reason, each term must be odd: If k were even, then so would be k+2. In fact, one of k or k+2 would be divisible by 4, so must indeed be 4 to have only two prime factors. However, neither 2,3,4 nor 4,5,6 is such a run. - Rick L. Shepherd, May 27 2002

k+1, which is twice a prime, is in A086005. The primes are in A086006. - T. D. Noe, May 31 2006

The squarefree terms are listed in A039833. - Jianing Song, Nov 30 2021

Equivalently: k, k+1 and k+2 all have 4 divisors.

There cannot be four consecutive squarefree numbers as one of them is divisible by 2^2 = 4.

These 3 consecutive squarefree numbers of the form p*q have altogether 6 prime factors always including 2 and 3. E.g., if k = 99985, the six prime factors are {2,3,5,19997,33329,49993}. The middle term is even and not divisible by 3.

Nonsquare terms of A056809. First terms of A056809 absent here are A056809(4)=121=11^2, A056809(14)=841=29^2, A056809(55)=6241=79^2.

Cf. A179502 (Numbers k with the property that k^2, k^2+1 and k^2+2 are all semiprimes). - Zak Seidov, Oct 27 2015

The numbers k, k+1, k+2 have the form 2p-1, 2p, 2p+1 where p is an odd prime. A195685 gives the sequence of odd primes that generates these maximal runs of three consecutive integers with four positive divisors. - Timothy L. Tiffin, Jul 05 2016

a(n) is always 1 or 9 mod 12. - Charles R Greathouse IV, Mar 19 2022

Start of a cluster of 8 consecutive odd semiprimes. Semiprimes in arithmetic progression. All terms are odd, see also A056809.

Note that there cannot exist 9 consecutive odd semiprimes. Out of any 9 consecutive odd numbers, one of them will be divisible by 9. The only multiple of 9 which is a semiprime is 9 itself and it is easy to see that's not part of a solution. - Jack Brennen, Jan 04 2006

For the first 500 terms, a(n) is roughly 40000*n^1.6, so the sequence appears to be infinite. Note that (a(n)+4)/3 and (a(n)+10)/3 are twin primes. - Don Reble, Jan 05 2006

All terms == 11 (mod 18). - Zak Seidov, Sep 27 2012

There is at least one even semiprime between k and k+14 for 1812 of the first 10000 terms. - Donovan Johnson, Oct 01 2012

All terms == {29,47,83} (mod 90). - Zak Seidov, Sep 13 2014

Among the first 10000 terms, from all 80000 numbers a(n)+m, m=0,2,4,6,8,10,12,14, the only square is a(4637) + 2 = 23538003241 = 153421^2 (153421 is prime, of course). - Zak Seidov, Dec 22 2014

The symmetric representation of sigma(m) has 3 regions of width 1 where the two extremal regions each have 2^k - 1 legs and the central region starts with the p-th leg of the associated Dyck path for sigma(m) precisely when m = 2^(k - 1) * p^2 where 2^k < p <= row(m), k >= 1, p >= 3 is prime and row(m) = floor((sqrt(8*m + 1) - 1)/2). Furthermore, the areas of the two outer regions are (2^k - 1)*(p^2 + 1)/2 each so that the area of the central region is (2^k - 1)*p; for a proof see the link.

Since the sequence is defined by a two-parameter expression it can be written naturally as a triangle as shown in the Example section.

A263951 is a subsequence of this sequence containing the squares of all those primes p for which the areas of the 3 regions in the symmetric representation of p^2 (p once and (p^2 + 1)/2 twice) are primes; i.e., p^2 and p^2 + 1 are semiprimes (see A070552). - Hartmut F. W. Hoft, Aug 06 2020

Starting with 33 all terms are odd. First squares are 4, 49, 169, 361, 529, 961, 1369, 2209, 2809, 4489, ... - Zak Seidov, Feb 17 2017

Semiprimes in arithmetic progression. All terms are odd, see also A056809.

Semiprimes in arithmetic progression. All terms are odd, see also A056809.

Semiprimes in arithmetic progression. All terms are odd, see also A056809.