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.

A237050 Number of ways to write n = i_1 + i_2 + i_3 + i_4 + i_5 (0 < i_1 <= i_2 <= i_3 <= i_4 <= i_5) with i_1, i_2, ..., i_5 not all equal such that the product i_1*i_2*i_3*i_4*i_5 is a fifth power.

Table of values

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

List of values

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