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.

A237127 Number of ways to write n = k + m (0 < k < m) with k and m terms of A072281.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 1, 3, 2, 3, 2, 3, 3, 3, 2, 2, 4, 3, 3, 2, 2, 4, 3, 4, 3, 4, 4, 3, 3, 4, 5, 4, 1, 3, 3, 5, 4, 4, 4, 4, 5, 3, 4, 2, 4, 4, 4, 5, 2, 4, 1, 4, 4, 4, 4, 1, 3, 4, 4, 5, 5]