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.

A373688 a(n) is the number of ways n can be written as a sum of a practical number and two hexagonal numbers.

Table of values

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

List of values

[1, 2, 2, 2, 1, 2, 2, 4, 2, 2, 1, 2, 3, 3, 1, 3, 3, 5, 3, 4, 2, 4, 3, 4, 3, 2, 3, 3, 3, 6, 5, 6, 4, 5, 4, 7, 4, 4, 3, 5, 3, 6, 3, 5, 4, 6, 6, 7, 6, 4, 4, 6, 4, 6, 5, 4, 7, 7, 3, 6, 7, 7, 6, 7, 3, 8, 5, 7, 6, 7, 6, 8, 6, 7, 7, 8, 4, 8, 7, 6]

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

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