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.

A116674 Triangle read by rows: T(n,k) is the number of partitions of n into odd parts and having exactly k distinct parts (n>=1, k>=1).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 1
6 2
7 1
8 2
9 2
10 2
11 3
12 1
13 5
14 3
15 4
16 1
17 2
18 7
19 1
20 2
21 8
22 2
23 2
24 10
25 3
26 2
27 11
28 5
29 2
30 13
31 7
32 4
33 12
34 11
35 1
36 19
37 11
38 1
39 2
40 18
41 17
42 1
43 3
44 20
45 21
46 2
47 2
48 22
49 27
50 3
51 2
52 25
53 32
54 5
55 4
56 24
57 41
58 7
59 2
60 30
61 46
62 11
63 2
64 31
65 56
66 15
67 2
68 36
69 62
70 22
71 3
72 33
73 80
74 25
75 1
76 2
77 39
78 87
79 36
80 1
81 4
82 38
83 103
84 45
85 2
86 2
87 45

List of values

[1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 3, 1, 5, 3, 4, 1, 2, 7, 1, 2, 8, 2, 2, 10, 3, 2, 11, 5, 2, 13, 7, 4, 12, 11, 1, 19, 11, 1, 2, 18, 17, 1, 3, 20, 21, 2, 2, 22, 27, 3, 2, 25, 32, 5, 4, 24, 41, 7, 2, 30, 46, 11, 2, 31, 56, 15, 2, 36, 62, 22, 3, 33, 80, 25, 1, 2, 39, 87, 36, 1, 4, 38, 103, 45, 2, 2, 45]