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!)
 A166926 A000004 preceded by 1, 2, 4. 4
 1, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Inverse binomial transform of A058331. LINKS FORMULA a(0) = 1, a(1) = 2, a(2) = 4, a(n) = 0 for n > 2. G.f.: (1+2*x+4*x^2). a(n)=1-[(n+2) mod (n+1)]+2*{C[(n+1)^2,n+3] mod 2}+4*{binomial[(n+12)^4,n+14] mod 2}, with n>=0 [From Paolo P. Lava, Nov 02 2009] PROG (PARI) {concat([1, 2, 4], vector(102))} CROSSREFS Cf. A000004 (zero sequence), A058331 (2*n^2+1), A130706 (1, 2, 0, 0, 0, 0, ...), A130779 (1, 1, 2, 0, 0, 0, 0, ...). Sequence in context: A334822 A082871 A321406 * A266296 A028573 A138758 Adjacent sequences:  A166923 A166924 A166925 * A166927 A166928 A166929 KEYWORD easy,nonn AUTHOR Klaus Brockhaus, Oct 23 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 July 23 17:22 EDT 2021. Contains 346259 sequences. (Running on oeis4.)