A225091 -id:A225091 - cp's OEIS frontend

A225093 a(1)=2, a(2)=3, for n>=3, a(n) is the n-th number which is obtained by application of Eratosthenes-like sieve to A225091.

2, 3, 7, 13, 5, 11, 31, 43, 37, 29, 73, 79, 19, 41, 97, 59, 103, 127, 71, 157, 17, 163, 89, 23, 107, 211, 181, 241, 199, 131, 67, 101, 61, 271, 277, 149, 313, 307, 47, 367, 173, 397, 331, 409, 179, 197, 191, 457, 251, 499, 239, 233, 487, 139, 547, 523, 571, 151

Offset: 1

Graph
List
Refs
Listen
History
Text
Internal format

Vladimir Shevelev, Apr 27 2013

nonn

We conjecture that every term is prime; moreover, we conjecture that the sequence is a permutation of the sequence of all primes. - Vladimir Shevelev, Dec 17 2014

Peter J. C. Moses, Table of n, a(n) for n = 1..2000

Cf. A000040, A221858, A225017, A225039, A225040, A225091, A251964, A252280, A252281, A252282, A252283.

Flatten[{{2,3}, DeleteDuplicates[Select[Map[#/(2^IntegerExponent[#,2])&[Total[IntegerDigits[7^#]]]&, Range[200]], PrimeQ]]}] (* Peter J. C. Moses, Apr 27 2013 *)

More terms from Peter J. C. Moses, Apr 27 2013

cp's OEIS Frontend

A225093 a(1)=2, a(2)=3, for n>=3, a(n) is the n-th number which is obtained by application of Eratosthenes-like sieve to A225091.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions