Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134664
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134664 Number of 3-stack sortable permutations on n letters. +0
1
1, 2, 6, 24, 114, 606, 3494, 21426, 137901, 922862, 6377818, 45281958, 328969075 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(5) = 114 because all but the 6 permutations 23451, 24351, 32451, 34251, 42351, 43251 on 5 letters become 12345 after at most 3 passes through the stack sorter.

CROSSREFS

Cf. A000139.

Adjacent sequences: A134661 A134662 A134663 this_sequence A134665 A134666 A134667

Sequence in context: A152325 A152329 A054872 this_sequence A068199 A128088 A069657

KEYWORD

hard,nonn

AUTHOR

Eric S Rowland (erowland(AT)math.rutgers.edu), Jan 25 2008

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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research