Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082972
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082972 Number of permutations of length n containing 4 occurrences of 132. +0
1
82, 410, 1918, 8657, 38225, 166322, 716170, 3059864, 12994936, 54924212, 231235054, 970347575, 4060697955, 16952812170, 70629116910, 293720506860, 1219498444500, 5055891511980, 20933654593020, 86571545598642 (list; graph; listen)
OFFSET

6,1

LINKS

T. Mansour and A. Vainshtein, Counting occurrences of 132 in a permutation

FORMULA

a(n)=(2*n-12)!/n!/24/(n-6)!*(n^9+102*n^8-282*n^7-12264*n^6+32589*n^5+891978*n^4-7589428*n^3+25452024*n^2-39821760*n+23950080)

PROGRAM

(PARI) a(n)=(2*n-12)!/n!/24/(n-6)!*(n^9+102*n^8-282*n^7-12264*n^6+32589*n^5+891978*n^4-\ 7589428*n^3+25452024*n^2-39821760*n+23950080)

CROSSREFS

Cf. A002054 (number of permutations of length n containing 1 occurrence of 132).

Sequence in context: A102956 A031696 A005972 this_sequence A031422 A002309 A128959

Adjacent sequences: A082969 A082970 A082971 this_sequence A082973 A082974 A082975

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 27 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research