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.

A376635 a(n+1) = size of the largest subset S of 1...n such that i+j <= n implies a(i+j) = a(i)+a(j) for i and j in S. Start with a(1) = 1.

Table of values

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

List of values

[1, 1, 1, 2, 3, 3, 4, 5, 4, 5, 5, 6, 7, 8, 9, 9, 8, 9, 10, 11, 12, 13, 12, 12, 13, 14, 15, 16, 17, 17, 16, 17, 17, 17, 17, 18, 19, 20, 21, 22, 23, 23, 22, 23, 24, 24, 24, 25, 25, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 35, 35, 36, 37, 37, 37, 37, 38, 38, 39, 39]