This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Antti Karttunen, Table of n, a(n) for n = 1..8192 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. A000035, A004001. Cf. A095902 (number of odd entries less than or equal to 2^n). Cf. A283480 (partial sums). Characteristic function of A283481. Sequence in context: A324822 A127239 A129186 * A087049 A186447 A118009 Adjacent sequences:  A095898 A095899 A095900 * A095902 A095903 A095904 KEYWORD easy,nonn AUTHOR Robert G. Wilson v, Jun 12 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 23 11:05 EDT 2019. Contains 323513 sequences. (Running on oeis4.)