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.

A185370 Triangle read by rows: T(n,k) is the number of occurrences of k in the n-th region of the set of partitions of j, if 1<=n<=A000041(j).

Table of values

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

List of values

[1, 1, 1, 2, 0, 1, 0, 1, 3, 1, 0, 1, 0, 0, 1, 5, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 7, 2, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 11, 2, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 2, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 15, 4, 1, 1, 0, 0, 0, 1]