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.

A354971 a(1)=1, a(2)=0; for n > 2, a(n) is the number of times a(n - 1 - a(n-1)) has appeared in the sequence.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.