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.

Showing 1-2 of 2 results.

A164962 a(n) is the least prime from the union {2,3} and A164333, beginning with which the n-th prime p_n is obtained by some number of iterations of the S operator g(see A164960).

Original entry on oeis.org

2, 3, 2, 3, 2, 13, 3, 19, 2, 13, 31, 3, 19, 43, 2, 53, 13, 61, 31, 71, 73, 3, 19, 43, 2, 101, 103, 53, 109, 113, 13, 131, 31
Offset: 1

Views

Author

Vladimir Shevelev, Sep 02 2009

Keywords

Comments

The sequence is connected with our sieve selecting the primes of the union {2,3} and A164333 from all primes. Note that a(n)=n iff p_n is in the considered union, which corresponds to 0's iterations of g.

Crossrefs

A164966 Primes which are obtained at least by two ways using the iterations of the S operator (see A164960) beginning with primes of the union of {2,3} and A164333.

Original entry on oeis.org

127, 149, 211, 223, 257, 307, 431, 449
Offset: 1

Views

Author

Vladimir Shevelev, Sep 02 2009

Keywords

Comments

The sequence is connected with our sieve selecting the primes of the union of {2,3} and A164333 from all primes.

Crossrefs

Showing 1-2 of 2 results.