Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095889
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095889 Number of permutations of [n] with exactly 3 descents which avoid the pattern 4321. +0
1
10, 148, 1260, 8160, 44790, 220180, 1001000, 4295168, 17633122, 69921460, 269652100, 1016524352, 3760334958, 13690636212, 49172875520, 174559419680, 613383654170, 2136135472020, 7380351046300, 25319087913760, 86308819112550 (list; graph; listen)
OFFSET

5,1

FORMULA

G.f.: 2*x^5*(5-36*x+82*x^2-36*x^3-87*x^4+80*x^5)/((1-x)^4*(1-2*x)^3*(1-3*x)^4).

CROSSREFS

Cf. A000295, A000460.

Sequence in context: A081697 A134526 A055761 this_sequence A097638 A098270 A157867

Adjacent sequences: A095886 A095887 A095888 this_sequence A095890 A095891 A095892

KEYWORD

nonn

AUTHOR

Mike Zabrocki (zabrocki(AT)mathstat.yorku.ca), Nov 10 2004

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research