login
A095901
A004001 (mod 2).
6
1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0
OFFSET
1,1
LINKS
FORMULA
a(n) = A004001(n) mod 2.
MATHEMATICA
a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; Table[ a[n], {n, 105}]
PROG
(Scheme) (define (A095901 n) (A000035 (A004001 n))) ;; Further code found under those two entries, Antti Karttunen, Mar 21 2017
CROSSREFS
Cf. A095902 (number of odd entries less than or equal to 2^n).
Cf. A283480 (partial sums).
Characteristic function of A283481.
Sequence in context: A129186 A353494 A190610 * A374036 A087049 A358680
KEYWORD
easy,nonn
AUTHOR
Robert G. Wilson v, Jun 12 2004
STATUS
approved