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.

A182289 Triangle read by rows. Let p be one of the parts of size A135010(n,k) in one of the partitions of n and S(n,k) = sum of all preceding parts to p in the mentioned partition of n. So T(n,k) = 2*S(n,k) + A135010(n,k).

Table of values

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

List of values

[1, 3, 2, 5, 5, 3, 7, 7, 7, 6, 2, 4, 9, 9, 9, 9, 9, 8, 3, 5, 11, 11, 11, 11, 11, 11, 11, 10, 6, 2, 10, 4, 9, 3, 6, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 8, 3, 12, 5, 11, 4, 7, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 10, 6]

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

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