cp's OEIS Frontend

A152114 Numbers a(n) are obtained by the application of an algorithm which is similar to sieve of Eratosthenes for A000045: retaining A000045(3)=2, we delete all multiples of 2, which are more than 2; retaining A000045(4)=3, we delete all multiples of 3, which are more than 3, etc.

%I A152114 #8 Jun 27 2020 22:00:06
%S A152114 2,3,5,13,89,233,1597,4181,28657,514229,1346269,24157817,165580141,
%T A152114 433494437,2971215073,53316291173,956722026041,2504730781961,
%U A152114 44945570212853,308061521170129,806515533049393,14472334024676221,99194853094755497,1779979416004714189
%N A152114 Numbers a(n) are obtained by the application of an algorithm which is similar to sieve of Eratosthenes for A000045: retaining A000045(3)=2, we delete all multiples of 2, which are more than 2; retaining A000045(4)=3, we delete all multiples of 3, which are more than 3, etc.
%C A152114 Since, as known, A000045((m,n))=(A000045(m),A000045(n)), then the indices of a(n) as terms of A000045, i.e., 3,4,5,7,11,13,..., except of 4, are the consecutive odd primes.
%C A152114 Apparently a variant of A030426. [From _R. J. Mathar_, Nov 27 2008]
%Y A152114 Cf. A000045, A005478, A075736.
%K A152114 nonn,easy
%O A152114 1,1
%A A152114 _Vladimir Shevelev_, Nov 24 2008
%E A152114 a(15)-a(24) from _Alois P. Heinz_, Jun 27 2020