This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218975 Number of connected cyclic conjugacy classes of subgroups of the alternating group. 0
1, 1, 0, 1, 1, 1, 2, 1, 3, 3, 4, 2, 8, 2 (list; graph; refs; listen; history; text; internal format)



a(n) is also the number of connected even partitions of n in the following sense. Given a partition of n, the vertices are the parts of the partition and two vertices are connected if and only if their gcd is greater than 1. We call a partition connected if the graph is connected.


Table of n, a(n) for n=0..13.

Liam Naughton and Goetz Pfeiffer, Integer sequences realized by the subgroup pattern of the symmetric group, arXiv:1211.1911 and J. Int. Seq. 16 (2013) #13.5.8

Liam Naughton, CountingSubgroups.g

Liam Naughton and Goetz Pfeiffer, Tomlib, The GAP table of marks library


Cf. A218970

Sequence in context: A082666 A057938 A144623 * A048619 A116087 A163281

Adjacent sequences:  A218972 A218973 A218974 * A218976 A218977 A218978




Liam Naughton, Nov 28 2012



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 00:09 EST 2019. Contains 329812 sequences. (Running on oeis4.)