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.

A317596 a(n) is the number of k with 1 <= k <= n-1 such that a(k) + 2 * a(n-k) <= n.

Table of values

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

List of values

[0, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 7, 8, 8, 9, 10, 11, 12, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 19, 20, 23, 25, 29, 31, 33, 34, 36, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 38, 38, 38, 38, 38, 39, 39, 39, 39]

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

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