[go: up one dir, main page]

login
A332998
a(n) = A000120(A332996(n)).
3
0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 2, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 2, 1, 2, 2, 2, 3, 4, 1, 2, 1, 1, 2, 3, 2, 3, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 2, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 2, 2, 3
OFFSET
0,14
FORMULA
a(n) = A000120(A332996(n)) = A332898(A332817(n)).
a(n) = A000120(n) - A332997(n).
Conjecture: for n >= 2, a(A086224(n-1)) = n, this being also the first occurrence of each n larger than 1.
PROG
(PARI) A332998(n) = hammingweight(A332996(n));
(PARI) A332998(n) = A332898(A332817(n));
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 05 2020
STATUS
approved