A020951 a(2n+1)=a(n), a(2n)=a(n)+a(n-1).

1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 2, 1, 1, 0, 1, 1, 2, 1, 3, 2, 3, 1, 3, 2, 3, 1, 2, 1, 1, 0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 4, 3, 5, 2, 5, 3, 4, 1, 3, 2, 3, 1, 2, 1, 1, 0, 1, 1, 2, 1, 3, 2, 3, 1, 4, 3, 5, 2, 5, 3, 4, 1, 5

Offset

0,11

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Prog

(Haskell)
a020951 n = a020951_list !! n
a020951_list = 1 : ws where
   ws = 0 : 1 : concat (zipWith (\u v -> [u, u + v]) ws $ tail ws)
-- Reinhard Zumkeller, Jul 19 2013, Mar 13 2013

Crossrefs

Cf. A082498.

Sequence in context: A063995 A280737 A322305 * A117118 A117168 A355343

Adjacent sequences: A020948 A020949 A020950 * A020952 A020953 A020954

Keyword

nonn

Author

Clark Kimberling

Status

approved