A095901 A004001 (mod 2).

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

Author

Robert G. Wilson v, Jun 12 2004

Keywords

• easy
• nonn

Links

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

Crossrefs

Cf. A000035, A004001.

Cf. A095902 (number of odd entries less than or equal to 2^n).

Cf. A283480 (partial sums).

Characteristic function of A283481.

Programs

Mathematica

a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; Table[ a[n], {n, 105}]

Scheme

(define (A095901 n) (A000035 (A004001 n))) ;; Further code found under those two entries, Antti Karttunen, Mar 21 2017

Formula

a(n) = A004001(n) mod 2.