Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130706
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A130706
%S A130706 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,
%T A130706 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,
%U A130706 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 A130706 a(0)=1, a(1)=2, a(n)=0 for n>1.
%C A130706 Inverse binomial transform of A005408.
%F A130706 G.f.: 1+2*x.
%F A130706 a(n)=[C(2*n,n) mod 2]+2*[C((n+1)^2,n+3) mod 2], n>=0 - Paolo P. Lava 
               (ppl(AT)spl.at), Oct 22 2007
%Y A130706 Sequence in context: A063665 A072507 A130779 this_sequence A000038 A063667 
               A014083
%Y A130706 Adjacent sequences: A130703 A130704 A130705 this_sequence A130707 A130708 
               A130709
%K A130706 easy,nonn
%O A130706 0,2
%A A130706 Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jun 27 2007

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research