cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A271707 Triangle read by rows, T(n,k) = Sum_{p in P(n,k)} Aut(p) where P(n,k) are the partitions of n with length k and Aut(p) = 1^j[1]*j[1]!*...*n^j[n]*j[n]! where j[m] is the number of parts in the partition p equal to m; for n>=0 and 0<=k<=n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 2
6 0
7 3
8 2
9 6
10 0
11 4
12 11
13 4
14 24
15 0
16 5
17 10
18 14
19 12
20 120
21 0
22 6
23 31
24 62
25 34
26 48
27 720
28 0
29 7
30 28
31 60
32 84
33 120
34 240
35 5040
36 0
37 8
38 66
39 102
40 490
41 228
42 552
43 1440
44 40320
45 0
46 9
47 60
48 299
49 292
50 708
51 912
52 3120
53 10080
54 362880
55 0
56 10
57 120
58 282
59 722
60 4396
61 2136
62 4752
63 20880
64 80640
65 3628800

List of values

[1, 0, 1, 0, 2, 2, 0, 3, 2, 6, 0, 4, 11, 4, 24, 0, 5, 10, 14, 12, 120, 0, 6, 31, 62, 34, 48, 720, 0, 7, 28, 60, 84, 120, 240, 5040, 0, 8, 66, 102, 490, 228, 552, 1440, 40320, 0, 9, 60, 299, 292, 708, 912, 3120, 10080, 362880, 0, 10, 120, 282, 722, 4396, 2136, 4752, 20880, 80640, 3628800]