Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027933
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027933 T(n,2n-10), T given by A027926. +0
2
1, 2, 5, 13, 34, 89, 232, 596, 1490, 3588, 8273, 18228, 38403, 77533, 150438, 281403, 509015, 892926, 1523117, 2532359, 4112704, 6536993, 10186540, 15586342, 23449376, 34731776, 50700937, 73018870, 103843433, 145950389 (list; graph; listen)
OFFSET

5,2

FORMULA

a(n)=sum(binomial(n-k, 10-2k), k=0..5). - Len Smiley (smiley(AT)math.uaa.alaska.edu), Oct 20 2001

Conjecture: a(n) = 34 -9161*n/280 -101897*n^3/20160 +794293*n^2/50400 -287*n^5/1280 +438209*n^4/362880 +5593*n^6/172800 -47*n^7/13440 -n^9/80640 +n^8/3780 +n^10/3628800. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 05 2009]

CROSSREFS

Sequence in context: A027931 A103142 A112844 this_sequence A141448 A011783 A122367

Adjacent sequences: A027930 A027931 A027932 this_sequence A027934 A027935 A027936

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research