Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072100
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A072100
%S A072100 1,2,3,5,8,14,24,44,79,149,275,527,989,1913,3629,7061,13496,26366,
%T A072100 50676,99296,191674,376430,729146,1434578,2786656,5490812,10691112,
%U A072100 21091712,41150012,81266612,158825372,313942892,614483087,1215563477
%N A072100 Column 2 of the array m(i,1)=m(1,j)=1 m(i,j)=m(i-1,j-1)+m(i-1,j+1) (a(n)=m(n,
               2)).
%C A072100 Partial sums of A001405, to which an additional leading 1 is added. - 
               Paul Barry (pbarry(AT)wit.ie), Oct 12 2004
%F A072100 G.f.: 1/2*x*(((1+2*x)/(1-2*x))^(1/2)-1)/(1-x)-1. - Vladeta Jovovic (vladeta(AT)eunet.rs), 
               Jan 15 2004
%F A072100 G.f. : (sqrt(1+2x)+1/sqrt(1-2x))/((1-x)(sqrt(1+2x)+sqrt(1-2x))); a(n)=1+sum{k=0..n, 
               binomial(n-1, floor((n-1)/2)}. - Paul Barry (pbarry(AT)wit.ie), Oct 
               12 2004
%Y A072100 Cf. A036256.
%Y A072100 Sequence in context: A079500 A007059 A108296 this_sequence A104882 A091956 
               A107480
%Y A072100 Adjacent sequences: A072097 A072098 A072099 this_sequence A072101 A072102 
               A072103
%K A072100 easy,nonn
%O A072100 1,2
%A A072100 Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 30 2002

    
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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research