cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262231 First term is 2; each subsequent term is the least number greater than the previous term but not a multiple of the successor of any previous term.

Original entry on oeis.org

2, 4, 7, 11, 13, 17, 19, 22, 26, 29, 31, 34, 37, 41, 43, 47, 49, 52, 58, 61, 67, 71, 73, 77, 79, 82, 86, 89, 91, 94, 97, 101, 103, 107, 109, 113, 116, 119, 121, 127, 131, 133, 137, 139, 142, 146, 149, 151, 157, 163, 167, 169, 172, 178, 181, 187, 191
Offset: 1

Views

Author

Drake Thomas, Sep 15 2015

Keywords

Comments

If the twin prime conjecture is true, this sequence has infinitely many pairs of terms with difference at most 3.

Examples

			25 is excluded because it is a multiple of 4+1; 26 is not a multiple of 3,5,8,...,23 so it remains in the sequence.
		

Crossrefs

Cf. A100464.

Programs

  • PARI
    has(n)=fordiv(n,d, if(mapisdefined(m, d-1), return(0))); 1
    first(n)=local(m=Map(Mat([2,0]))); my(t=3); while(#mCharles R Greathouse IV, Sep 16 2015

Formula

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