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.

A384773 a(1) = 1, a(2) = 1. For n > 2 if a(n-1) = k is a novel term, a(n) = a(n-1-k). Otherwise if a(n-1) is a repeat term a(n) = number of m; 1 <= m <= n-2 such that a(m) = a(n-1).

Table of values

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

List of values

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