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.

A227779 Least splitter of s(n) and s(n+1), where s(n) = sum{(k + 1/2)^(-1/2), k >= 1}.

Table of values

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

List of values

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