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.

A286720 Number of Egyptian fractions in the representation of 1-1/(2n+1) by the odd greedy expansion algorithm, without repeats.

Table of values

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

List of values

[4, 6, 6, 4, 6, 6, 4, 6, 6, 6, 8, 6, 6, 10, 6, 6, 8, 6, 12, 10, 10, 4, 6, 6, 6, 8, 6, 6, 8, 10, 6, 6, 8, 8, 6, 10, 6, 8, 6, 8, 6, 10, 6, 10, 6, 10, 6, 10, 6, 8, 8, 6, 8, 8, 8, 6, 6, 6, 10, 8, 6, 8, 10, 12, 8, 10, 6, 8, 8, 8, 10, 8, 6, 8, 10, 6, 8, 8, 6, 6, 8]