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
%I A001493
%S A001493 1,0,1,2,7,8,37,40,200,258,1039,1501,7629
%N A001493 Number of fixed-point-free permutation groups of degree n.
%D A001493 Alexander Hulpke, Konstruktion transitiver Permutationsgruppen, Dissertation, 
               RWTH Aachen, 1996.
%D A001493 A. Hulpke, Constructing transitive permutation groups, J. Symbolic Comput. 
               39 (2005), 1-30.
%D A001493 A. Hulpke, Constructing Transitive Permutation Groups, in preparation
%H A001493 A. Hulpke, <a href="http://www.math.colostate.edu/~hulpke/smalldeg.html">
               Transitive groups of small degree</a>
%H A001493 <a href="Sindx_Gre.html#groups">Index entries for sequences related to 
               groups</a>
%F A001493 a(n)=A000638(n)-A000638(n-1). (Christian G. Bower (bowerc(AT)usa.net), 
               Feb 23 2006)
%Y A001493 Cf. A000019, A002106. Unlabeled version of A116693.
%Y A001493 Sequence in context: A081700 A093795 A000637 this_sequence A081999 A011355 
               A021362
%Y A001493 Adjacent sequences: A001490 A001491 A001492 this_sequence A001494 A001495 
               A001496
%K A001493 nonn,hard,nice
%O A001493 0,4
%A A001493 Alexander Hulpke (Alexander.Hulpke(AT)Math.RWTH-Aachen.DE)
%E A001493 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.001 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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research