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.

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

Table of values

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

List of values

[1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 1, 2, 2, 2, 1, 2, 3, 3, 1, 4, 2, 3, 2, 4, 3, 3, 2, 4, 3, 4, 2, 4, 4, 3, 1, 3, 4, 3, 2, 4, 5, 5, 3, 5, 4, 4, 2, 5, 6, 5, 2, 4, 3, 4, 1, 6, 5, 5, 2, 4, 4, 5, 3, 6, 5, 5, 4, 5, 6, 5, 3, 7, 5, 5, 3, 4, 6, 5, 3, 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.