|
|
|
|
1, 5, 19, 34, 135, 261, 1028, 1032, 2054, 8203, 32777, 32785, 524320, 1048591, 1048592, 1048704, 2097162, 8388864, 16777235, 16777251, 268435521, 536870945, 536871169, 2147483712, 4294967809, 68719476749, 137438953984, 137438955520, 274877906967, 1099511627794
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
If f(n) denotes the binary tree representation of n defined in A324556, then this sequence lists the n such that f(n) is symmetrical.
|
|
LINKS
|
|
|
EXAMPLE
|
34 is '100010' in binary, which is a one, followed by 3 zeros, followed by '10' = 2. Then, following the rules specified in A324556, 34 can be represented by the partial decomposition tree:
34
/ \
2 3
Pursuing the decomposition process yields the complete decomposition tree:
34
/ \
/ \
/ \
/ \
/ \
2 3
/ \ / \
0 1 1 0
/ \ / \
0 0 0 0
With values removed, this tree is symmetrical. So, 34 is in the sequence.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|