Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164870
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A164870 The number of permutations of length n that can be sorted by 2 pop stacks in parallel +0
1
1, 2, 6, 22, 84, 320, 1212, 4576, 17256, 65048, 245184, 924160, 3483408, 13129952, 49490592, 186544480, 703140672, 2650342784, 9989916864, 37654917376, 141932392320, 534984681344, 2016513669120, 7600829555200, 28649748728064 (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.: (2*x^3-6*x^2+5*x-1)/(-1+6*x-10*x^2+6*x^3)

CROSSREFS

Sequence in context: A150241 A150242 A150243 this_sequence A121686 A128723 A150244

Adjacent sequences: A164867 A164868 A164869 this_sequence A164871 A164872 A164873

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified February 9 11:24 EST 2010. Contains 172296 sequences.


AT&T Labs Research