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.

A026819 a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284.

Table of values

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

List of values

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