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.

A384660 a(1) = 1. Thereafter a(n) = a(a(n-1)) if a(n-1) is a novel term, or n - S(n) if a(n-1) is a repeat term. S(n) is the sum of distinct terms in multiset {a(1),a(2),..a(n-1)}.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 2, 2, 3, 4, 1, 2, 3, 4, 5, 2, 2, 3, 4, 5, 6, 3, 2, 3, 4, 5, 6, 7, 2, 2, 3, 4, 5, 6, 7, 8, 2, 2, 3, 4, 5, 6, 7, 8, 9, 3, 2, 3, 4, 5, 6, 7, 8, 9, 10, 4, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 2, 2, 3, 4, 5, 6, 7]