Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A164872 The number of permutations of length n that can be sorted by 4 pop stacks in parallel +0
1
1, 2, 6, 24, 120, 718, 4884, 35546, 264590, 1969912, 14560996, 106781758, 778073440, 5643649364, 40811356112, 294554236798, 2123419108962, 15296729408614, 110149122090326, 792974948890068, 5707931771206042 (list; graph; listen)
OFFSET

1,2

LINKS

R. Smith and V. Vatter, The enumeration of permutations sortable by pop stacks in parallel

FORMULA

G.f.: (1584*x^11-14016*x^10+45432*x^9-79454*x^8+86562*x^7-62624*x^6+30887*x^5-10411* x^4+2352*x^3-339*x^2+28*x-1)/(7920*x^11-40116*x^10+96324*x^9-139728*x^8+133468 *x^7-87278*x^6+39670*x^5-12495*x^4+2666*x^3-366*x^2+29*x-1)

CROSSREFS

Sequence in context: A152347 A068200 A121987 this_sequence A052398 A047890 A071088

Adjacent sequences: A164869 A164870 A164871 this_sequence A164873 A164874 A164875

KEYWORD

nonn

AUTHOR

Vince Vatter (vatter(AT)gmail.com), Aug 29 2009

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research