|
Search: id:A065562
|
|
|
| A065562 |
|
a(n) = b(n)_th highest positive integer not equal to any a(k), 1 <= k < n, where {b(n)} = 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5,... (sequence A002260). |
|
+0
4
|
|
| 1, 2, 4, 3, 6, 8, 5, 9, 11, 13, 7, 12, 15, 17, 19, 10, 16, 20, 22, 24, 26, 14, 21, 25, 28, 30, 32, 34, 18, 27, 31, 35, 37, 39, 41, 43, 23, 33, 38, 42, 45, 47, 49, 51, 53, 29, 40, 46, 50, 54, 56, 58, 60, 62, 64, 36, 48, 55, 59, 63, 66, 68, 70, 72, 74, 76, 44, 57, 65, 69, 73, 77
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Every positive integer occurs once and only once somewhere in this sequence.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
Index entries for sequences that are permutations of the natural numbers
|
|
EXAMPLE
|
b(6) = 3, so a(6) = 8 = 3_rd highest positive integer not equal to 1, 2, 4, 3, or 6 (the values of a(k), 1 <= k < 6).
|
|
CROSSREFS
|
Cf. A002260, A065579, A065561.
Sequence in context: A143529 A103867 A075375 this_sequence A120233 A137621 A039864
Adjacent sequences: A065559 A065560 A065561 this_sequence A065563 A065564 A065565
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Nov 29 2001
|
|
|
Search completed in 0.002 seconds
|
