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.

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

Table of values

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

List of values

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

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

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