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.

A308597 Number of ways to write n as a*(a+1)/2 + b*(b+1)/2 + 2^c*5^d, where a,b,c,d are nonnegative integers with a <= b and d <= 1.

Table of values

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

List of values

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