This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A141009 E.g.f. exp(Sum_{d|M} (exp(d*x)-1)/d), M=13. 2
 1, 2, 18, 262, 4498, 88174, 1989162, 51366438, 1491069602, 47749828830, 1664928894170, 62693869629142, 2534737217687378, 109469680507411214, 5025930552213949450, 244236790780300327302, 12515419830686362586882 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Also the number of partitions of {1..(13n)} that are invariant under a permutation consisting of n 13-cycles. - Danny Rorabaugh, Oct 29 2015 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 T. S. Motzkin, Sorting numbers for cylinders and other classification numbers, in Combinatorics, Proc. Symp. Pure Math. 19, AMS, 1971, pp. 167-176. [Annotated, scanned copy] OEIS Wiki, Sorting numbers MATHEMATICA u[0, j_]: = 1; u[k_, j_]: = u[k, j] = Sum[Binomial[k-1, i-1]Plus@@(u[k-i, j]#^(i-1)&/@Divisors[j]), {i, k}]; Table[u[n, 13], {n, 0, 30}] (* Vincenzo Librandi, Dec 12 2012, after Wouter Meeussen in similar sequences *) mx = 16; p = 13; Range[0, mx]! CoefficientList[ Series[ Exp[ (Exp[p*x] - p - 1)/p + Exp[x]], {x, 0, mx}], x] (* Robert G. Wilson v, Dec 12 2012 *) CROSSREFS Column 13 of A162663. Sequence in context: A151362 A215362 A099880 * A143154 A032037 A138275 Adjacent sequences:  A141006 A141007 A141008 * A141010 A141011 A141012 KEYWORD nonn AUTHOR R. J. Mathar, Jul 11 2008 STATUS approved

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.

Last modified January 17 10:30 EST 2019. Contains 319218 sequences. (Running on oeis4.)