The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A303728 Triangle read by rows: T(n,k) is the number of labeled cyclic subgroups of order k in the alternating group A_n, 1 <= k <= A051593(n). 2
 1, 1, 1, 0, 1, 1, 3, 4, 1, 15, 10, 0, 6, 1, 45, 40, 45, 36, 1, 105, 175, 315, 126, 105, 120, 1, 315, 616, 1890, 336, 2520, 960, 0, 0, 0, 0, 0, 0, 0, 336, 1, 1323, 2884, 9450, 756, 18900, 4320, 0, 6720, 2268, 0, 3780, 0, 0, 3024, 1, 5355, 15520, 47250, 19656 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS EXAMPLE Triangle begins: 1; 1; 1, 0, 1; 1, 3, 4; 1, 15, 10, 0, 6; 1, 45, 40, 45, 36; 1, 105, 175, 315, 126, 105, 120; 1, 315, 616, 1890, 336, 2520, 960, 0, 0, 0, 0, 0, 0, 0, 336; ... PROG (PARI) permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m} G(n)={my(s=0); forpart(p=n, if(sum(i=1, #p, p[i]-1)%2==0, my(d=lcm(Vec(p))); s+=x^d*permcount(p)/eulerphi(d))); s} for(n=1, 10, print(Vecrev(G(n)/x))) CROSSREFS Row sums are A051636. Cf. A051593, A074881, A181950. Sequence in context: A200659 A059110 A100326 * A321627 A350557 A028338 Adjacent sequences: A303725 A303726 A303727 * A303729 A303730 A303731 KEYWORD nonn,tabf AUTHOR Andrew Howroyd, Jul 03 2018 STATUS approved

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

Last modified December 1 07:34 EST 2022. Contains 358454 sequences. (Running on oeis4.)