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.

A337853 a(n) is the number of partitions of n as the sum of two Niven numbers.

Table of values

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

List of values

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