Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089264
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089264 Number of permutations of length n containing exactly once 132 and 213, likewise for pattern pair (231,312). +0
2
3, 6, 17, 42, 102, 242, 564, 1296, 2944, 6624, 14784, 32768, 72192, 158208, 345088, 749568, 1622016, 3497984, 7520256, 16121856, 34471936, 73531392, 156499968, 332398592, 704643072, 1491075072, 3149922304, 6643777536, 13992198144 (list; graph; listen)
OFFSET

4,1

LINKS

A. Robertson, Permutations restricted by two distinct patterns of length three

FORMULA

For n>=7, (n^2+21*n-28)*2^(n-9).

CROSSREFS

Cf. A001815.

Adjacent sequences: A089261 A089262 A089263 this_sequence A089265 A089266 A089267

Sequence in context: A049943 A027415 A007718 this_sequence A121399 A129905 A143363

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 30 2003

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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research