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.

A340805 a(n) is the number of solutions of the equation x*(y - 1) + (2*x - y - 1)*(x mod 2) = 2*n for 0 < x <= y.

Table of values

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

List of values

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