Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000388
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000388 Number of permutations of an n-sequence discordant with three given permutations (see reference) in n-2 places.
(Formerly M4139 N1717)
+0
8
6, 20, 180, 1106, 9292, 82980, 831545, 9139482, 109595496, 1423490744, 19911182207, 298408841160, 4770598226296, 81037124739588, 1457607971046492, 27675791180024802, 553166885187641670, 11609691036091870428, 255273744004170486155, 5868308906885934514178 (list; graph; listen)
OFFSET

4,1

REFERENCES

J. Riordan, Discordant permutations, Scripta Math., 20 (1954), 14-23.

FORMULA

a(n) = coefficient of y^2 in sum_0^n sigma_{n, k}(n - k)!(y - 1)^k on y where the sigma_{n, k} have generating function sigma(t, u)=(1 - 2t^2(u^2) - 2t^2(1 + t)u^3 + 3t^4(u^4))(1 - tu)^( - 1)(1 - (1 + 2t)u - tu^2 + t^3(u^3))^( - 1).

MAPLE

seq(f(n, 2), n=5..30); #code for f(n, k) is given in A000440

CROSSREFS

Cf. A000500, A000470, A000440, A000476, A000380, A000492.

Adjacent sequences: A000385 A000386 A000387 this_sequence A000389 A000390 A000391

Sequence in context: A027148 A095854 A027268 this_sequence A069257 A133885 A064929

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

More terms, formula and Maple code from Barbara Haas Margolius (margolius(AT)math.csuohio.edu) 2/17/01

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