|
Search: id:A152114
|
|
|
| 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. |
|
+0
1
|
|
| 2, 3, 5, 13, 89, 233, 1597, 4181, 28657, 514229, 1346269, 24157817, 165580141, 433494437
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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 (mathar(AT)strw.leidenuniv.nl), Nov 27 2008]
|
|
CROSSREFS
|
A000045 A005478 A075736
Sequence in context: A001685 A074691 A139589 this_sequence A139095 A005478 A117740
Adjacent sequences: A152111 A152112 A152113 this_sequence A152115 A152116 A152117
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladimir Shevelev (shevelev(AT)bgu.ac.il), Nov 24 2008
|
|
|
Search completed in 0.002 seconds
|
