|
Search: id:A133436
|
|
|
| A133436 |
|
Generated by a kind of sieve (see Comments lines). |
|
+0
1
|
|
| 2, 5, 7, 11, 14, 18, 21, 27, 29, 34, 40, 42, 50, 53, 57, 62, 69, 72, 79, 84, 89, 93, 103, 105, 110, 119, 124, 131, 135, 145, 149, 156, 160, 170, 176, 179, 185, 194, 200, 207, 214, 218, 231, 234, 242, 248, 259, 263, 270, 277, 281, 293, 300, 305, 315, 322, 329, 339
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Start with the list of positive integers.
Call the current version of the list b(1), b(2), b(3), ...
Remove b(1) = 1 and renumber the terms.
Remove b(2) and b(2+1) from the remaining list and renumber the terms.
Remove b(3), b(3+2) and b(3+2+1) from the remaining list and renumber the terms.
Remove b(4), b(4+3), b(4+3+2) and b(4+3+2+1) from the remaining list and renumber the terms.
Repeat the process. What is left forms the sequence.
|
|
LINKS
|
Austin C. Green and T. D. Noe, Table of n, a(n) for n=1..1000 (b-file extended and corrected).
|
|
EXAMPLE
|
a(3) = 7 because:
integer 1 is eliminated in the first round,
integers 3 and 4 are eliminated in the second round and
integers 6, 8 and 9 are eliminated in the third round.
This leaves the numbers 2, 5, 7...
|
|
CROSSREFS
|
Sequence in context: A079379 A095272 A099835 this_sequence A001225 A157001 A134640
Adjacent sequences: A133433 A133434 A133435 this_sequence A133437 A133438 A133439
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Austin C. Green (whyphi(AT)gmail.com), Nov 25 2007
|
|
|
Search completed in 0.002 seconds
|
