login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164871 The number of permutations of length n that can be sorted by 3 pop stacks in parallel 0
1, 2, 6, 24, 118, 644, 3622, 20366, 113686, 630464, 3481084, 19171838, 105444400, 579547826, 3184321642, 17493771830, 96100287256, 527905628552, 2899911094078, 15929870658308, 87506389326742, 480692570563526 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

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

FORMULA

G.f.: (1-13*x+63*x^2-148*x^3+177*x^4-98*x^5+18*x^6)/(1-14*x+75*x^2-201*x^3+288*x^4-\ 216*x^5+72*x^6)

CROSSREFS

Sequence in context: A097483 A007405 A177518 * A079106 A088713 A193938

Adjacent sequences:  A164868 A164869 A164870 * A164872 A164873 A164874

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:50 EST 2012. Contains 206050 sequences.