A336121 - OEIS

A336121

a(1) = 0, and for n > 1, a(n) = [A122111(n) == 3 (mod 4)] + a(A253553(n)).

0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 2, 1, 1, 0, 1, 0, 2, 0, 3, 0, 1, 1, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 3, 1, 2, 0, 1, 0, 1, 0, 1, 0, 3, 1, 2, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 3, 0, 1, 0, 1, 1, 1, 0, 2, 0, 3, 0, 1, 0, 1, 1, 3, 0, 2, 0, 2, 0, 2, 0, 2, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,16

COMMENTS

Positions for the first occurrence of each n, for n >= 0, are: 1, 4, 16, 32, 144, 512, 2048, 6912, 20736, 62208, ...

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

FORMULA

a(1) = 0, and for n > 1, a(n) = [A336124(n) == 3] + a(A253553(n)).

a(n) = A000120(A336120(n)).

a(n) = A292377(A122111(n)).

a(n) = A001222(n) - A336123(n).