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.

A182701 Triangle T(n,k) = n*A000041(n-k) read by rows, 1 <= k <= n. Sum of the parts of all partitions of n that contain k as a part.

Table of values

n a(n)
1 1
2 2
3 2
4 6
5 3
6 3
7 12
8 8
9 4
10 4
11 25
12 15
13 10
14 5
15 5
16 42
17 30
18 18
19 12
20 6
21 6
22 77
23 49
24 35
25 21
26 14
27 7
28 7
29 120
30 88
31 56
32 40
33 24
34 16
35 8
36 8
37 198
38 135
39 99
40 63
41 45
42 27
43 18
44 9
45 9
46 300
47 220
48 150
49 110
50 70
51 50
52 30
53 20
54 10
55 10
56 462
57 330
58 242
59 165
60 121
61 77
62 55
63 33
64 22
65 11
66 11
67 672
68 504
69 360
70 264
71 180
72 132
73 84
74 60
75 36
76 24
77 12
78 12

List of values

[1, 2, 2, 6, 3, 3, 12, 8, 4, 4, 25, 15, 10, 5, 5, 42, 30, 18, 12, 6, 6, 77, 49, 35, 21, 14, 7, 7, 120, 88, 56, 40, 24, 16, 8, 8, 198, 135, 99, 63, 45, 27, 18, 9, 9, 300, 220, 150, 110, 70, 50, 30, 20, 10, 10, 462, 330, 242, 165, 121, 77, 55, 33, 22, 11, 11, 672, 504, 360, 264, 180, 132, 84, 60, 36, 24, 12, 12]