|
0, 1, 2, 1, 3, 2, 4, 1, 2, 3, 6, 2, 5, 4, 3, 1, 7, 2, 8, 3, 4, 6, 10, 2, 3, 5, 2, 4, 9, 3, 12, 1, 6, 7, 4, 2, 11, 8, 5, 3, 13, 4, 14, 6, 3, 10, 16, 2, 4, 3, 7, 5, 15, 2, 6, 4, 8, 9, 18, 3, 17, 12, 4, 1, 5, 6, 20, 7, 10, 4, 22, 2, 19, 11, 3, 8, 6, 5, 24, 3, 2, 13, 26, 4, 7, 14, 9, 6, 21, 3, 5, 10, 12, 16, 8, 2, 23, 4, 6, 3, 25, 7, 28, 5, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
a(n) tells how many odd numbers are encountered when map x -> A332893(x) is used to traverse from n to 1, the root of the binary tree A332815. This count includes both the starting n itself if it is odd, but excludes 1 where the iteration ends.
a(n) also gives the index of the largest prime factor (A061395) in A332808(n), which is the inverse permutation of A108548 (see also A108546).
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A000035, A061395, A080791, A332808, A332811, A332815, A332816, A332893, A332894, A332897, A332898.
Cf. A000079 (after its initial term, gives the positions of 1's).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|