login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332997 a(n) = A000120(A332995(n)). 3
0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 3, 1, 1, 2, 2, 1, 2, 1, 2, 2, 2, 3, 4, 1, 2, 1, 1, 2, 3, 2, 3, 1, 1, 2, 3, 1, 1, 2, 2, 2, 3, 2, 3, 3, 3, 4, 5, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 3, 4, 2, 2, 3, 3, 1, 2, 1, 2, 2, 2, 3, 4, 1, 2, 1, 1, 2, 3, 2, 3, 2, 2, 3, 4, 2, 2, 3, 3, 3, 4, 3, 4, 4, 4, 5, 6, 1, 2, 1, 1, 2, 3, 2, 3, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
It seems that a(A055010(n)) = n for all n >= 0, and apart from n=1, A055010 seems to give the first occurrence of each n in this sequence.
LINKS
FORMULA
a(n) = A000120(A332995(n)) = A332897(A332817(n)).
a(n) = A000120(n) - A332998(n).
PROG
(PARI) A332997(n) = hammingweight(A332995(n));
(PARI) A332997(n) = A332897(A332817(n));
CROSSREFS
Sequence in context: A087187 A029380 A298485 * A298614 A108129 A078349
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 05 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 07:08 EDT 2024. Contains 371698 sequences. (Running on oeis4.)