OFFSET
0,10
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..65537
FORMULA
For all n, a(4*n) = 0 and a(4*n + 2) is either 1 or 3. [See comments in A235991]
For all n >= 2, a(n) = A010873[(A353496(n)*A353497(n)) + A353490(n)]. (This is essentially Reinhard Zumkeller's May 09 2011 recursive formula of A003415, when reduced modulo 4) - Antti Karttunen, Apr 26 2022
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Apr 22 2022
STATUS
approved