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.

A366597 Irregular triangular array, read by rows: T(n,k) = number of vertices (partitions) that have degree k in the distance graph of the partitions of n, for k = 1..A366429(n).

Table of values

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

List of values

[0, 2, 2, 1, 2, 1, 2, 2, 0, 4, 1, 2, 2, 2, 4, 0, 1, 2, 0, 4, 7, 0, 0, 2, 2, 2, 2, 9, 2, 0, 4, 1, 2, 1, 4, 11, 2, 0, 4, 6, 2, 2, 2, 14, 6, 0, 4, 9, 2, 0, 0, 1, 2, 0, 4, 17, 6, 0, 2, 19, 4, 0, 0, 0, 2, 2, 4, 2, 16, 10, 1, 6, 17, 14, 0, 0, 0, 4, 1, 2, 0, 4, 23]