Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024427
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024427 S(n,1) + S(n-1,2) + +S(n-2,3) + ... + S(n+1-k,k), where k=[ (n+1)/2 ] and S(i,j) are Stirling numbers of second kind. +0
5
1, 1, 2, 4, 9, 22, 58, 164, 495, 1587, 5379, 19195, 71872, 281571, 1151338, 4902687, 21696505, 99598840, 473466698, 2327173489, 11810472444, 61808852380, 333170844940, 1847741027555 (list; graph; listen)
OFFSET

1,3

FORMULA

G.f.: sum{k>=0, x^(2k)/prod[l=1..k, 1-lx]}. - R. Stephan, Apr 18 2004

a(n)=sum(stirling2(n-1-i,i), i=0..n-2), n>=3 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 31 2008

MAPLE

with(combinat):seq(sum(stirling2(n-1-i, i), i=0..n-2), n=3..26); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 31 2008

CROSSREFS

Sequence in context: A124380 A059019 A121953 this_sequence A092920 A035053 A000571

Adjacent sequences: A024424 A024425 A024426 this_sequence A024428 A024429 A024430

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 July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research