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.

A023193 a(n) gives the largest number k for which there is at least one admissible k-tuple taken from [0, 1, ..., n-1] if the tuple starts with 0. Admissibility is defined in a comment.

Table of values

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

List of values

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