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.

A238885 Array: row n gives number of times each possible lower triangular partition L(p) occurs as p ranges through the partitions of n.

Table of values

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

List of values

[1, 2, 2, 1, 2, 3, 2, 2, 3, 2, 2, 6, 1, 2, 2, 6, 1, 4, 2, 2, 8, 2, 4, 4, 2, 2, 8, 2, 6, 1, 8, 1, 2, 2, 10, 2, 6, 2, 12, 4, 2, 2, 2, 10, 2, 8, 2, 12, 1, 12, 4, 1, 2, 2, 12, 2, 8, 2, 16, 2, 12, 6, 9, 4, 2, 2, 12, 2, 10, 2, 16, 2, 16, 8, 1, 18, 6, 4, 2, 2, 14, 2]

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

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