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.

A348966 Variation on the Inventory Sequence A342585: record the number of occurrences of the pair sum of all adjacent terms until 0 is recorded, then restart the count from 0. Start with a(0) = 0. See the Comments.

Table of values

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

List of values

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