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.

A379381 a(1)=1, a(2)=2; thereafter, a(n) is the smallest positive integer such that for any value k, the number of distinct values between a pair of k's is distinct, counting k itself.

Table of values

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

List of values

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