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.

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.

This page as a plain text file.
%I A225093 #16 Dec 29 2014 18:39:02
%S A225093 2,3,7,13,5,11,31,43,37,29,73,79,19,41,97,59,103,127,71,157,17,163,89,
%T A225093 23,107,211,181,241,199,131,67,101,61,271,277,149,313,307,47,367,173,
%U A225093 397,331,409,179,197,191,457,251,499,239,233,487,139,547,523,571,151
%N 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.
%C A225093 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
%H A225093 Peter J. C. Moses, <a href="/A225093/b225093.txt">Table of n, a(n) for n = 1..2000</a>
%t A225093 Flatten[{{2,3}, DeleteDuplicates[Select[Map[#/(2^IntegerExponent[#,2])&[Total[IntegerDigits[7^#]]]&, Range[200]], PrimeQ]]}] (* _Peter J. C. Moses_, Apr 27 2013 *)
%Y A225093 Cf. A000040, A221858, A225017, A225039, A225040, A225091, A251964, A252280, A252281, A252282, A252283.
%K A225093 nonn
%O A225093 1,1
%A A225093 _Vladimir Shevelev_, Apr 27 2013
%E A225093 More terms from _Peter J. C. Moses_, Apr 27 2013