Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027932
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A027932
%S A027932 1,3,8,21,55,143,364,894,2098,4685,9955,20175,39130,72905,130965,
%T A027932 227612,383911,630191,1009242,1580345,2424289,3649547,5399802,
%U A027932 7863034,11282400,15969161,22317933,30824563,42106956,56929205
%N A027932 T(n,2n-9), T given by A027926.
%F A027932 a(n)=sum(binomial(n-k, 9-2k), k=0..4). - Len Smiley (smiley(AT)math.uaa.alaska.edu), 
               Oct 20 2001
%F A027932 a(n)=C(n,n-1)+C(n+1,n-2)+C(n+2,n-3)+C(n+3,n-4)+C(n+4,n-5), n>=1 . - Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), May 29 2007
%p A027932 seq(binomial(n,n-1)+binomial(n+1,n-2)+binomial(n+2,n-3)+binomial(n+3,
               n-4)+binomial(n+4,n-5), n=1..30); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               May 29 2007
%Y A027932 Sequence in context: A077849 A135473 A005580 this_sequence A084625 A001906 
               A088305
%Y A027932 Adjacent sequences: A027929 A027930 A027931 this_sequence A027933 A027934 
               A027935
%K A027932 nonn
%O A027932 5,2
%A A027932 Clark Kimberling (ck6(AT)evansville.edu)

    
page 1

Search completed in 0.001 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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research