login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A161974
a(n) = number of equalities of the form A010060(n+k) = A010060(n), k=1,2,3.
1
1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1
OFFSET
0,2
COMMENTS
See comment to A161916. 3-a(n) is the number of equalities of kind A010060(n+k) = 1-A010060(n), k=1,2,3.
PROG
(PARI) a(n)=sum(k=1, 3, hammingweight(n)%2==hammingweight(n+k)%2) \\ Charles R Greathouse IV, Aug 20 2013
KEYWORD
nonn,easy
AUTHOR
Vladimir Shevelev, Jun 23 2009
EXTENSIONS
Missing a(24)=1 inserted by Georg Fischer, Jun 21 2024
STATUS
approved