|
|
A255567
|
|
a(1) = 1, a(2) = 2, after which, a(2n+1) = 1 + a(2n), a(2n) = A255411(a(n)).
|
|
2
|
|
|
1, 2, 3, 12, 13, 16, 17, 72, 73, 76, 77, 90, 91, 94, 95, 480, 481, 484, 485, 498, 499, 502, 503, 576, 577, 580, 581, 594, 595, 598, 599, 3600, 3601, 3604, 3605, 3618, 3619, 3622, 3623, 3696, 3697, 3700, 3701, 3714, 3715, 3718, 3719, 4200, 4201, 4204, 4205, 4218, 4219, 4222, 4223, 4296, 4297, 4300, 4301, 4314, 4315, 4318, 4319
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
From 2 onward, the sequence seems to give those n for which A256450(A255411(n))+1 = A255411(A256450(n)), i.e., grandparents for those cousins in tree A255566 where the cousin at the right side is one more than the cousin at the left side.
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1, a(2) = 2, after which, a(2n+1) = 1 + a(2n), a(2n) = A255411(a(n)).
|
|
EXAMPLE
|
This sequence can be represented as a binary tree. Apart from the 1 at root, and its children 2 and 3, from then on each left hand child is produced as A255411(n), and each right hand child as 1 + A255411(n) when parent contains n >= 2:
..................1..................
2 3
12......./ \.......13 16......./ \.......17
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
72 73 76 77 90 91 94 95
480 481 484 485 498 499 502 503 576 577 580 581 594 595 598 599
etc.
|
|
PROG
|
;; This for now conjectured to be equal from a(2) onward:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|