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.

A303543 Number of ways to write n as a^2 + b^2 + C(k) + C(m) with 0 <= a <= b and 0 < k <= m, where C(k) denotes the Catalan number binomial(2k,k)/(k+1).

Table of values

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

List of values

[0, 1, 2, 3, 2, 3, 4, 4, 2, 3, 5, 5, 2, 3, 5, 5, 4, 3, 6, 8, 4, 3, 6, 6, 3, 3, 5, 7, 6, 3, 4, 8, 5, 2, 6, 7, 3, 4, 5, 5, 6, 4, 5, 10, 6, 4, 7, 8, 4, 2, 7, 9, 9, 5, 7, 11, 8, 2, 5, 11, 5, 4, 4, 8, 8, 4, 6, 11, 10, 3, 6, 8, 5, 5, 6, 7, 6, 6, 5, 9]