|
Search: id:A056875
|
|
|
| A056875 |
|
Generated by sieving the natural numbers: keep the smallest remaining number k and take out its k-th successor l as well as the l-th successor m of l, the m-th successor of m and so on. Then start again from the next remaining number. |
|
+0
1
|
|
| 1, 3, 5, 6, 9, 10, 11, 13, 14, 18, 19, 20, 21, 23, 24, 27, 28, 30, 33, 34, 36, 38, 40, 41, 42, 43, 44, 46, 47, 50, 51, 53, 55, 58, 59, 60, 62, 65, 68, 69, 70, 71, 73, 74, 76, 79, 80, 82, 83, 84, 85, 88, 89, 91, 92, 93, 95, 96, 97, 101, 102, 103, 105, 106, 109, 111, 113, 114
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
These numbers are homogeneously distributed with a density of appr. 0.59060.
|
|
EXAMPLE
|
In the first round one starts with 1 and the numbers 2,4,8,16,... are removed leaving 1,3,5,6,7,9,10,11,12,13,14,15,17,18,19,20,... The third successor of 3 is now 7 and the 7-th of 7 is 15 leaving 1,3,5,6,8,9,10,11,12,13,14,16,...
|
|
CROSSREFS
|
Sequence in context: A005623 A016612 A098587 this_sequence A087757 A088359 A065871
Adjacent sequences: A056872 A056873 A056874 this_sequence A056876 A056877 A056878
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Thomas Schulze (jazariel(AT)tiscalenet.it), Sep 02 2000
|
|
|
Search completed in 0.002 seconds
|
