A026453 -id:A026453 - cp's OEIS frontend

A026416 A 2-way classification of integers: a(1) = 1, a(2) = 2 and for n > 2, a(n) is the smallest number not of the form a(i)*a(j) for 1 <= i < j < n.

1, 2, 3, 4, 5, 7, 9, 11, 13, 16, 17, 19, 23, 24, 25, 29, 30, 31, 37, 40, 41, 42, 43, 47, 49, 53, 54, 56, 59, 61, 66, 67, 70, 71, 73, 78, 79, 81, 83, 88, 89, 97, 101, 102, 103, 104, 105, 107, 109, 110, 113, 114, 121, 127, 128, 130, 131, 135, 136, 137, 138, 139

Offset: 1

Clark Kimberling

An equivalent definition is: a(1) = 1, a(2) = 2; and for n > 2, a(n) = least positive integer > a(n-1) and not of the form a(i)*a(j) for 1 <= i < j < n.
a(2) to a(29) match the initial terms of A000028. [corrected by Peter Munn, Mar 15 2019]
This has a simpler definition than A000028, but the resulting pair lacks the crucial property of the A000028/A000379 pair (see the comment in A000028). - N. J. A. Sloane, Sep 28 2007
Contains (for example) 180, so is different from A123193. - Max Alekseyev, Sep 20 2007
From Vladimir Shevelev, Apr 05 2013: (Start)
1) The sequence does not contain (for example) 140, so is different from A000028.
2) Representation of numbers which are absent in the sequence as a product of two different terms of the sequence is, generally speaking, not unique. For example, 210 = 2*105 = 3*70 = 5*42 = 7*30.
(End)
Excluding a(1) = 1, the lexicographically earliest sequence of distinct nonnegative integers such that no term is a product of 2 distinct terms. Removing the latter distinctness requirement, the sequence becomes A026424; and the equivalent sequence where the product is of 2 or more distinct terms is A050376. A000028 is similarly the equivalent sequence when A059897 is used as multiplicative operator in place of standard integer multiplication. - Peter Munn, Mar 15 2019

			a(8) is not 10 because we already have 10 = 2*5. Of course all primes appear. 16 appears because 16 is not a product of earlier terms.

Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..400 from Vincenzo Librandi)

Complement of A131181. Cf. A000028, A059897.
Cf. A066724, A026477, A050376, A084400.
Similar sequences with different starting conditions: A026417 (1,3), A026419 (1,4), A026420 (2,4), A026421 (3,4).
Related sequences with definition using any products (not necessarily distinct) and with various starting conditions: A026422 (1,2),A026423 (1,3), A026424 (2,3), A026425 (1,4), A026426 (2,4), A026427 (3,4).
See also families of related sequences: A026431 (excluding product-1), A026443 (excluding product+2), A026453 (excluding product-2) and references therein.

a[1]=1; a[2]=2; a[n_] := a[n] = For[k = a[n-1] + 1, True, k++, If[ FreeQ[ Table[ a[i]*a[j], {i, 1, n-2}, {j, i+1, n-1}], k], Return[k]]]; Table[a[n], {n, 1, 101}] (* Jean-François Alcover, May 16 2013 *)

from itertools import count, islice
def agen(): # generator of terms
    a, products = [1, 2], {2}
    yield from a
    for k in count(3):
        if k not in products:
            yield k
            products.update(k*a[i] for i in range(len(a)))
            a.append(k)
        products.discard(k)
print(list(islice(agen(), 62))) # Michael S. Branicky, Jun 09 2025

More terms from Max Alekseyev, Sep 23 2007

Edited by N. J. A. Sloane, Jul 13 2008 at the suggestion of R. J. Mathar and Max Alekseyev

A026454 a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)-2 for 1<=i

Original entry on oeis.org

1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 20, 21, 23, 24, 27, 29, 32, 35, 36, 37, 39, 41, 44, 45, 47, 48, 50, 51, 55, 56, 57, 59, 60, 62, 63, 65, 69, 71, 72, 74, 76, 77, 80, 81, 84, 87, 89, 91, 92, 93, 95, 99, 101, 102, 104, 105, 107

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {1, 3}; used = {a[[1]]*a[[2]] - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 2]; AppendTo[a, k], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

Definition corrected by Harvey P. Dale, Jun 12 2013

A026460 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.

Original entry on oeis.org

1, 3, 4, 5, 6, 8, 9, 11, 12, 15, 17, 19, 20, 21, 24, 26, 27, 29, 32, 33, 35, 36, 37, 39, 40, 41, 44, 45, 47, 48, 50, 51, 54, 56, 57, 59, 60, 63, 65, 67, 68, 69, 71, 72, 75, 77, 80, 81, 84, 87, 89, 90, 91, 92, 95, 96, 99, 101, 104, 105

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {1, 3}; used = {a[[1]]^2 - 2, a[[1]]*a[[2]] - 2, a[[2]]^2 - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; AppendTo[a, k]; used = Union[used, k*a - 2], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

A026461 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n.

Original entry on oeis.org

2, 3, 5, 6, 9, 11, 12, 14, 15, 17, 18, 19, 21, 24, 27, 29, 30, 33, 35, 37, 38, 39, 41, 42, 44, 45, 47, 48, 50, 51, 54, 57, 59, 60, 62, 63, 65, 66, 67, 69, 71, 75, 77, 78, 81, 84, 87, 89, 90, 91, 95, 96, 99, 101, 102, 104, 105, 107, 108, 110

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {2, 3}; used = {a[[1]]^2 - 2, a[[1]]*a[[2]] - 2, a[[2]]^2 - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; AppendTo[a, k]; used = Union[used, k*a - 2], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

A026455 a(n) = least positive integer < a(n-1) and not a(i)*a(j)-2 for 1<=i

Original entry on oeis.org

2, 3, 5, 6, 7, 9, 11, 14, 15, 17, 18, 21, 22, 23, 24, 27, 29, 30, 35, 36, 37, 38, 39, 41, 45, 47, 48, 50, 51, 54, 55, 57, 59, 60, 62, 63, 65, 66, 69, 71, 77, 78, 81, 84, 86, 87, 89, 90, 91, 93, 95, 99, 101, 102, 104, 105, 107, 110, 111, 114

Offset: 1

Clark Kimberling

nonn

Appears to be A026453 shifted once left. - R. J. Mathar, Jul 13 2025

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {2, 3}; used = {a[[1]]*a[[2]] - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 2]; AppendTo[a, k], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

A026456 a(n) = least positive integer < a(n-1) and not a(i)*a(j)-2 for 1<=i

Original entry on oeis.org

1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 23, 24, 25, 27, 29, 31, 32, 35, 36, 37, 39, 41, 44, 45, 47, 49, 51, 55, 56, 57, 59, 60, 65, 67, 69, 71, 72, 77, 79, 80, 81, 84, 85, 87, 91, 92, 95, 99, 101, 104, 105, 107

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {1, 4}; used = {a[[1]]*a[[2]] - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 2]; AppendTo[a, k], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

A026457 a(n) = least positive integer < a(n-1) and not a(i)*a(j)-2 for 1<=i

Original entry on oeis.org

2, 4, 5, 7, 9, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 25, 27, 29, 30, 31, 35, 37, 39, 41, 45, 46, 47, 49, 51, 55, 57, 59, 62, 64, 65, 67, 69, 70, 71, 77, 78, 79, 81, 84, 85, 87, 91, 94, 95, 99, 101, 102, 104, 105, 107, 109, 110, 111, 119

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {2, 4}; used = {a[[1]]*a[[2]] - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 2]; AppendTo[a, k], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

A026458 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i

Original entry on oeis.org

3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 20, 21, 23, 24, 27, 29, 32, 35, 36, 37, 39, 41, 44, 45, 47, 48, 50, 51, 55, 56, 57, 59, 60, 62, 63, 65, 69, 71, 72, 74, 76, 77, 80, 81, 84, 87, 89, 91, 92, 93, 95, 99, 101, 102, 104, 105, 107, 108

Offset: 1

Clark Kimberling

nonn

Apparently the same as A026454 without the leading 1.- R. J. Mathar, Jul 22 2025

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {3, 4}; used = {a[[1]]*a[[2]] - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 2]; AppendTo[a, k], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

Definition corrected by Harvey P. Dale, Oct 16 2014

A026462 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.

Original entry on oeis.org

1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 19, 20, 21, 24, 25, 27, 29, 31, 32, 35, 36, 37, 39, 41, 44, 45, 49, 51, 55, 56, 57, 59, 60, 65, 67, 69, 71, 72, 77, 80, 81, 84, 85, 87, 90, 91, 92, 95, 96, 99, 101, 104, 105, 107, 109, 111

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {1, 4}; used = {a[[1]]^2 - 2, a[[1]]*a[[2]] - 2, a[[2]]^2 - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; AppendTo[a, k]; used = Union[used, k*a - 2], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

A026463 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.

Original entry on oeis.org

2, 4, 5, 7, 9, 10, 11, 13, 15, 17, 19, 21, 22, 25, 27, 29, 30, 31, 35, 37, 39, 41, 44, 45, 46, 49, 51, 54, 55, 57, 59, 62, 64, 65, 67, 69, 70, 71, 77, 78, 81, 84, 85, 87, 91, 92, 94, 95, 99, 101, 102, 104, 105, 107, 109, 110, 111, 113, 120

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..1000

Cf. A026453 and references therein.

a = {2, 4}; used = {a[[1]]^2 - 2, a[[1]]*a[[2]] - 2, a[[2]]^2 - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; AppendTo[a, k]; used = Union[used, k*a - 2], {n, 3, 60}]; a (* Ivan Neretin, Mar 06 2016 *)

cp's OEIS Frontend

A026416 A 2-way classification of integers: a(1) = 1, a(2) = 2 and for n > 2, a(n) is the smallest number not of the form a(i)*a(j) for 1 <= i < j < n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A026454 a(n) = least positive integer > a(n-1) and not equal to a(i)*a(j)-2 for 1<=i

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Extensions

A026460 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A026461 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A026455 a(n) = least positive integer < a(n-1) and not a(i)*a(j)-2 for 1<=i

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A026456 a(n) = least positive integer < a(n-1) and not a(i)*a(j)-2 for 1<=i

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A026457 a(n) = least positive integer < a(n-1) and not a(i)*a(j)-2 for 1<=i

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A026458 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A026462 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<=j<=n, n >= 2.

Views

Author

Keywords

Links

Crossrefs

Programs