Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054479 Number of sets of cycle graphs of 2n nodes where the 2-colored edges alternate colors. +0
2
1, 0, 6, 120, 6300, 514080, 62785800, 10676746080, 2413521910800, 700039083744000, 253445583029839200, 112033456760809584000, 59382041886244720843200, 37175286835046004765120000 (list; graph; listen)
OFFSET

0,3

COMMENT

Also number of permutations in the symmetric group S_2n in which cycle lengths are even and greater than 2, cf. A130915. - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 25 2007

FORMULA

If b(2n)=a(n) then egf of b is 1/(sqrt(e^x^2 * (1-x^2))).

CROSSREFS

Cf. A001147, A001818, A053871.

Sequence in context: A012846 A012641 A012795 this_sequence A012475 A053777 A023199

Adjacent sequences: A054476 A054477 A054478 this_sequence A054480 A054481 A054482

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Mar 29 2000

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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research