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.

A214966 Array T(m,n) = greatest k such that 1/n + ... + 1/(n+k-1) <= m, by rising antidiagonals.

Table of values

n a(n)
1 1
2 3
3 2
4 10
5 9
6 4
7 30
8 29
9 16
10 6
11 82
12 81
13 48
14 22
15 7
16 226
17 225
18 134
19 67
20 28
21 9
22 615
23 614
24 370
25 188
26 86
27 35
28 11
29 1673
30 1672
31 1012
32 517
33 241
34 105
35 41
36 12
37 4549
38 4548
39 2756
40 1413
41 664
42 295
43 124
44 47
45 14
46 12366
47 12365
48 7498
49 3847
50 1814
51 811
52 348
53 143
54 54

List of values

[1, 3, 2, 10, 9, 4, 30, 29, 16, 6, 82, 81, 48, 22, 7, 226, 225, 134, 67, 28, 9, 615, 614, 370, 188, 86, 35, 11, 1673, 1672, 1012, 517, 241, 105, 41, 12, 4549, 4548, 2756, 1413, 664, 295, 124, 47, 14, 12366, 12365, 7498, 3847, 1814, 811, 348, 143, 54]