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.

A361614 Set a(1)=0 and a(2)=1. For n > 1, if a(n) has already appeared in the sequence, then a(n+1) = number of steps since its first appearance. If a(n) has not appeared before, search instead for a(n)-1, then a(n)-2, etc., until you find a number that has appeared before.

Table of values

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

List of values

[0, 1, 1, 1, 2, 3, 1, 5, 2, 4, 4, 1, 10, 5, 6, 7, 1, 15, 5, 11, 7, 5, 14, 3, 18, 7, 10, 14, 5, 21, 5, 23, 2, 28, 2, 30, 2, 32, 2, 34, 2, 36, 2, 38, 2, 40, 2, 42, 2, 44, 2, 46, 2, 48, 2, 50, 2, 52, 2, 54, 2, 56, 2, 58, 2, 60, 2, 62, 2, 64, 2, 66, 2, 68, 2, 70, 2]