Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060015
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060015 Sum of orders of all even permutations of n letters. +0
6
1, 1, 7, 31, 211, 1411, 12601, 137047, 1516831, 18111751, 223179001, 2973194071, 46287964867, 835826439631, 15722804528341, 292673102609791, 5177400032329231, 102538737981192607, 2284570602107946601 (list; graph; listen)
OFFSET

1,3

EXAMPLE

For n = 4 there is 1 even permutation (1) of order 1, 3 even permutations (12)(34) etc. of order 2 and 8 (123) etc. of order 3, for a total of 31.

CROSSREFS

Cf. A060014.

Adjacent sequences: A060012 A060013 A060014 this_sequence A060016 A060017 A060018

Sequence in context: A102239 A139151 A139060 this_sequence A094711 A143564 A135630

KEYWORD

nonn,nice,easy

AUTHOR

njas, Mar 17 2001

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 18 2001

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 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research