The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020951 a(2n+1)=a(n), a(2n)=a(n)+a(n-1). 4

%I #11 Jul 20 2013 16:27:22

%S 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,

%T 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,

%U 3,2,3,1,4,3,5,2,5,3,4,1,5

%N a(2n+1)=a(n), a(2n)=a(n)+a(n-1).

%H Reinhard Zumkeller, <a href="/A020951/b020951.txt">Table of n, a(n) for n = 0..10000</a>

%o a020951 n = a020951_list !! n

%o a020951_list = 1 : ws where

%o ws = 0 : 1 : concat (zipWith (\u v -> [u, u + v]) ws \$ tail ws)

%o -- _Reinhard Zumkeller_, Jul 19 2013, Mar 13 2013

%Y Cf. A082498.

%K nonn

%O 0,11

%A _Clark Kimberling_

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

Last modified June 9 09:54 EDT 2023. Contains 363178 sequences. (Running on oeis4.)