The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A158780 a(2n) = A131577(n). a(2n+1) = A011782(n). 2
 0, 1, 1, 1, 2, 2, 4, 4, 8, 8, 16, 16, 32, 32, 64, 64, 128, 128, 256, 256, 512, 512, 1024, 1024, 2048, 2048, 4096, 4096, 8192, 8192, 16384, 16384, 32768, 32768, 65536, 65536, 131072, 131072, 262144, 262144, 524288 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS This construction combines the 2 basic sequences which equal their first differences in the same way as A138635 does for sequences which equal their 3rd differences and A137171 does for sequences which equal their fourth differences. Essentially the same as A016116, A060546, and A131572. - R. J. Mathar, Apr 08 2009 Dropping a(0), this is the inverse binomial transform of A024537. - R. J. Mathar, Apr 08 2009 LINKS Index entries for linear recurrences with constant coefficients, signature (0, 2). FORMULA a(2n)+a(2n+1)= A000079(n). G.f.: x*(1+x-x^2)/(1-2*x^2). - R. J. Mathar, Apr 08 2009 CROSSREFS Sequence in context: A082267 A338739 A076939 * A117575 A131572 A152166 Adjacent sequences:  A158777 A158778 A158779 * A158781 A158782 A158783 KEYWORD nonn AUTHOR Paul Curtz, Mar 26 2009 EXTENSIONS Edited by R. J. Mathar, Apr 08 2009 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 June 16 02:14 EDT 2021. Contains 345055 sequences. (Running on oeis4.)