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.

A350029 Write n as n = k1 + k2 + ... + km, so that all k are distinct positive integers. a(n) is the maximum value of A001055(k1) + A001055(k2) + ... + A001055(km) over all such partitions.

Table of values

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

List of values

[1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 19, 18, 19, 19, 19, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 23, 23, 23, 24, 24, 24, 25, 25]

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

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