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.

A181391 Van Eck's sequence: 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) = n-m; 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 6
11 0
12 5
13 0
14 2
15 6
16 5
17 4
18 0
19 5
20 3
21 0
22 3
23 2
24 9
25 0
26 4
27 9
28 3
29 6
30 14
31 0
32 6
33 3
34 5
35 15
36 0
37 5
38 3
39 5
40 2
41 17
42 0
43 6
44 11
45 0
46 3
47 8
48 0
49 3
50 3
51 1
52 42
53 0
54 5
55 15
56 20
57 0
58 4
59 32
60 0
61 3
62 11
63 18
64 0
65 4
66 7
67 0
68 3
69 7
70 3
71 2
72 31
73 0
74 6
75 31
76 3
77 6
78 3
79 2
80 8
81 33
82 0
83 9
84 56
85 0
86 3
87 8
88 7
89 19
90 0
91 5
92 37
93 0
94 3
95 8
96 8
97 1

List of values

[0, 0, 1, 0, 2, 0, 2, 2, 1, 6, 0, 5, 0, 2, 6, 5, 4, 0, 5, 3, 0, 3, 2, 9, 0, 4, 9, 3, 6, 14, 0, 6, 3, 5, 15, 0, 5, 3, 5, 2, 17, 0, 6, 11, 0, 3, 8, 0, 3, 3, 1, 42, 0, 5, 15, 20, 0, 4, 32, 0, 3, 11, 18, 0, 4, 7, 0, 3, 7, 3, 2, 31, 0, 6, 31, 3, 6, 3, 2, 8, 33, 0, 9, 56, 0, 3, 8, 7, 19, 0, 5, 37, 0, 3, 8, 8, 1]