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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
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. 9

%I

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

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

%U 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

%N a(0) = 1, a(1) = 2, a(n) = 0 for n > 1.

%C Inverse binomial transform of A005408.

%C Decimal expansion of 3/25. - _Franklin T. Adams-Watters_, Mar 08 2019

%C 2^n mod 4. - _Charles R Greathouse IV_, Apr 30 2019

%F G.f.: 1 + 2*x.

%F 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

%t RealDigits[12, 10, 100][[1]] (* _Alonso del Arte_, Sep 16 2016 *)

%o (PARI) .12 \\ _Charles R Greathouse IV_, Sep 16 2016

%K easy,nonn

%O 0,2

%A _Philippe Deléham_, Jun 27 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)