|
Search: id:A123929
|
|
|
| A123929 |
|
Simili-primes of order 2. |
|
+0
10
|
|
| 3, 5, 8, 13, 17, 22, 28, 31, 38, 43, 47, 53, 59, 67, 73, 77, 82, 89, 97, 101, 107, 113, 121, 127, 133, 139, 148, 151, 158, 163, 167, 179, 191, 197, 203, 209, 218, 227, 233, 241, 251, 257, 262, 269, 274, 281, 284, 293, 307, 313, 317, 322, 332, 343, 347, 353, 361
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Start examining the natural numbers from 2 on, and call an "atom" the first integer which cannot be divided by another "atom"; this sieve produces the prime numbers. Here we call "atom" the second integer which cannot be divided by another "atom" - thus the sequence starts with 3 (not 2), and continues with 5 (not 4), then 8 (not 6 or 7), then 13, etc.
Terms computed by Mensanator.
|
|
REFERENCES
|
J.-P. Delahaye, Inventiones \`{a} suivre, Pour la Science, No. 353, 2007, to appear.
|
|
LINKS
|
Mensanator, Table of n, a(n) for n = 1..150
Eric Angelini, Thousand Zetas
Eric Angelini, Thousand Zetas
|
|
FORMULA
|
Conjecture : a(n) is asymptotic to c*n*log(n) with c about 1.5. - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 11 2007
|
|
CROSSREFS
|
Cf. A126618-A126624.
Adjacent sequences: A123926 A123927 A123928 this_sequence A123930 A123931 A123932
Sequence in context: A092360 A129141 A097431 this_sequence A036715 A053651 A104563
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Eric Angelini and Hugo van der Sanden (eric.angelini(AT)kntv.be), Nov 22 2006
|
|
|
Search completed in 0.002 seconds
|
