OFFSET
0,5
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..16382
FORMULA
a(n) = mod(-1+Sum_{k=0..floor(n/2)} mod(binomial(n-k, k), 2), 3).
a(n) = mod(-1+A002487(n+1), 3).
a(2n+1) = a(n).
MATHEMATICA
Mod[Flatten[NestList[Flatten[Transpose[{#, # + RotateLeft[#]}]] &, {1}, 6]] - 1, 3] (* Paolo Xausa, Aug 04 2025, after Takashi Tokita at A002487 *)
PROG
(Python)
from functools import reduce
def A101650(n): return (sum(reduce(lambda x, y:(x[0], x[0]+x[1]) if int(y) else (x[0]+x[1], x[1]), bin(n+1)[-1:2:-1], (1, 0)))-1)%3 # Chai Wah Wu, Jul 31 2025
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 10 2004
STATUS
approved
