A152114 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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.

2, 3, 5, 13, 89, 233, 1597, 4181, 28657, 514229, 1346269, 24157817, 165580141, 433494437, 2971215073, 53316291173, 956722026041, 2504730781961, 44945570212853, 308061521170129, 806515533049393, 14472334024676221, 99194853094755497, 1779979416004714189

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

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.

Apparently a variant of A030426. [From R. J. Mathar, Nov 27 2008]

LINKS

Table of n, a(n) for n=1..24.

CROSSREFS

Cf. A000045, A005478, A075736.

Sequence in context: A001685 A074691 A139589 * A139095 A005478 A117740

Adjacent sequences: A152111 A152112 A152113 * A152115 A152116 A152117

KEYWORD

nonn,easy

AUTHOR

Vladimir Shevelev, Nov 24 2008

EXTENSIONS

a(15)-a(24) from Alois P. Heinz, Jun 27 2020

STATUS

approved