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.

A303235 Number of ordered pairs (x, y) with 0 <= x <= y such that n - 2^x - 2^y can be written as the sum of two triangular numbers.

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 4, 5, 6, 6, 6, 8, 7, 7, 8, 8, 8, 10, 10, 10, 10, 9, 9, 11, 9, 10, 11, 10, 9, 12, 10, 11, 14, 13, 11, 14, 12, 12, 13, 15, 12, 14, 12, 13, 14, 14, 14, 15, 13, 11, 14, 13, 11, 16, 13, 10, 11, 13, 11, 14]