Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A164871
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A164871 The number of permutations of length n that can be sorted by 3 pop stacks in parallel +0
1
1, 2, 6, 24, 118, 644, 3622, 20366, 113686, 630464, 3481084, 19171838, 105444400, 579547826, 3184321642, 17493771830, 96100287256, 527905628552, 2899911094078, 15929870658308, 87506389326742, 480692570563526 (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.: (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: A082631 A097483 A007405 this_sequence A079106 A088713 A135106

Adjacent sequences: A164868 A164869 A164870 this_sequence A164872 A164873 A164874

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