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”).
%I #16 Jun 22 2024 00:43:54
%S 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,
%T 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,
%U 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
%N a(n) = number of equalities of the form A010060(n+k) = A010060(n), k=1,2,3.
%C See comment to A161916. 3-a(n) is the number of equalities of kind A010060(n+k) = 1-A010060(n), k=1,2,3.
%o (PARI) a(n)=sum(k=1,3,hammingweight(n)%2==hammingweight(n+k)%2) \\ _Charles R Greathouse IV_, Aug 20 2013
%Y Cf. A161916, A161890, A161824, A161817, A161674, A161673, A161639, A161641, A161627, A161579, A161580, A121539, A131323, A036554, A010060.
%K nonn,easy
%O 0,2
%A _Vladimir Shevelev_, Jun 23 2009
%E Missing a(24)=1 inserted by _Georg Fischer_, Jun 21 2024