Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001493
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001493 Number of fixed-point-free permutation groups of degree n. +0
4
1, 0, 1, 2, 7, 8, 37, 40, 200, 258, 1039, 1501, 7629 (list; graph; listen)
OFFSET

0,4

REFERENCES

Alexander Hulpke, Konstruktion transitiver Permutationsgruppen, Dissertation, RWTH Aachen, 1996.

A. Hulpke, Constructing transitive permutation groups, J. Symbolic Comput. 39 (2005), 1-30.

A. Hulpke, Constructing Transitive Permutation Groups, in preparation

LINKS

A. Hulpke, Transitive groups of small degree

Index entries for sequences related to groups

FORMULA

a(n)=A000638(n)-A000638(n-1). (Christian G. Bower (bowerc(AT)usa.net), Feb 23 2006)

CROSSREFS

Cf. A000019, A002106. Unlabeled version of A116693.

Adjacent sequences: A001490 A001491 A001492 this_sequence A001494 A001495 A001496

Sequence in context: A081700 A093795 A000637 this_sequence A081999 A011355 A021362

KEYWORD

nonn,hard,nice

AUTHOR

Alexander Hulpke (Alexander.Hulpke(AT)Math.RWTH-Aachen.DE)

EXTENSIONS

a(2) and a(10) corrected, a(11) and a(12) added by Christian G. Bower (bowerc(AT)usa.net), Feb 23 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research