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.

A180681 T(n,k) is the sum of the hook lengths over the partitions of n with exactly k parts.

Table of values

n a(n)
1 1
2 3
3 3
4 6
5 5
6 6
7 10
8 16
9 8
10 10
11 15
12 23
13 22
14 12
15 15
16 21
17 47
18 44
19 30
20 17
21 21
22 28
23 62
24 74
25 56
26 40
27 23
28 28
29 36
30 104
31 115
32 114
33 71
34 52
35 30
36 36
37 45
38 130
39 196
40 162
41 139
42 89
43 66
44 38
45 45
46 55
47 195
48 268
49 286
50 227
51 169
52 110
53 82
54 47
55 55
56 66
57 235
58 395
59 407
60 369
61 269
62 204
63 134
64 100
65 57
66 66

List of values

[1, 3, 3, 6, 5, 6, 10, 16, 8, 10, 15, 23, 22, 12, 15, 21, 47, 44, 30, 17, 21, 28, 62, 74, 56, 40, 23, 28, 36, 104, 115, 114, 71, 52, 30, 36, 45, 130, 196, 162, 139, 89, 66, 38, 45, 55, 195, 268, 286, 227, 169, 110, 82, 47, 55, 66, 235, 395, 407, 369, 269, 204, 134, 100, 57, 66]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.