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.

A268755 Variant of A181391: For n >= 1, if there exists an m < n such that a(m) = a(n), take the largest such m and set a(n+1) = #{a(m), a(m+1), ..., a(n)}; otherwise, a(n+1) = 0. Start with a(1) = 0.

Table of values

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

List of values

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