login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130706 a(0) = 1, a(1) = 2, a(n) = 0 for n > 1. 8
1, 2, 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, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Inverse binomial transform of A005408.

LINKS

Table of n, a(n) for n=0..104.

FORMULA

G.f.: 1 + 2*x.

a(n) = [C(2*n, n) mod 2] + 2*[C((n + 1)^2, n + 3) mod 2], n >= 0 - Paolo P. Lava, Oct 22 2007

MATHEMATICA

RealDigits[12, 10, 100][[1]] (* Alonso del Arte, Sep 16 2016 *)

PROG

(PARI) .12 \\ Charles R Greathouse IV, Sep 16 2016

CROSSREFS

Sequence in context: A276306 A072507 A130779 * A000038 A063667 A228594

Adjacent sequences:  A130703 A130704 A130705 * A130707 A130708 A130709

KEYWORD

easy,nonn

AUTHOR

Philippe Deléham, Jun 27 2007

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 17 19:58 EST 2017. Contains 294834 sequences.