Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124937
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124937 Number of solvable transitive Galois groups for polynomials of degree n. +0
2
1, 1, 2, 5, 3, 12, 4, 45, 30, 30, 4, 266, 6, 36, 64, 1905, 5, 892, 6, 759 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(5) = 3: for polynomials of degree 5 we have 3 solvable groups: C5 (T5_1), D5 (T5_2) and F5(T5_3)

PROGRAM

(GAP) "a(15)= ", l:=AllTransitiveGroups(NrMovedPoints, 15, IsSolvable, true); - Artur Jasinski (grafix(AT)csl.pl), Feb 04 2007

CROSSREFS

Cf. A002106, A124938.

Adjacent sequences: A124934 A124935 A124936 this_sequence A124938 A124939 A124940

Sequence in context: A129198 A122442 A120858 this_sequence A091265 A028415 A035334

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Nov 13 2006

EXTENSIONS

More terms from Artur Jasinski (grafix(AT)csl.pl), Feb 04 2007

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 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research