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.

A268060 Least k such that A268057(n, k) = A268058(n).

Table of values

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

List of values

[1, 1, 2, 3, 3, 4, 4, 5, 5, 6, 7, 7, 8, 9, 8, 9, 10, 11, 12, 13, 13, 14, 14, 13, 16, 15, 16, 17, 16, 17, 20, 19, 20, 25, 22, 22, 21, 24, 22, 23, 24, 23, 27, 28, 29, 29, 30, 29, 31, 32, 31, 33, 32, 32, 36, 33, 35, 35, 34, 34, 37, 39, 38, 41, 41, 40, 43, 43, 44]