Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125188
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125188 Number of Dumont permutations of the first kind of length 2n avoiding the patterns 2413 and 4132. Also number of Dumont permutations of the first kind of length 2n avoiding the patterns 1423 and 3142. +0
2
1, 1, 3, 12, 54, 259, 1294, 6655, 34986, 187149, 1015407, 5574829, 30915904, 172933249, 974605751, 5528804444, 31546576802, 180931023589, 1042503934315, 6031773336043, 35030156585236, 204135876541762, 1193291688154639 (list; graph; listen)
OFFSET

0,3

REFERENCES

A. Burstein, Restricted Dumont permutations, Annals of Combinatorics, 9, 2005, 269-280 (Theorem 3.13).

FORMULA

G.f.=[1+xC(x)-sqrt(1-xC(x)-5x)]/[2x(1+C(x))], where C(x)=(1-sqrt(1-4x))/(2x) is the Catalan function.

MAPLE

C:=(1-sqrt(1-4*x))/2/x: G:=(1+x*C-sqrt(1-x*C-5*x))/2/x/(1+C): Gser:=series(G, x=0, 30): seq(coeff(Gser, x, n), n=0..26);

CROSSREFS

Cf. A125187.

Sequence in context: A123348 A083881 A055835 this_sequence A054666 A006026 A107264

Adjacent sequences: A125185 A125186 A125187 this_sequence A125189 A125190 A125191

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 19 2006

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research