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.

A346778 Least k >= 1 such that {b(1), b(2), ..., b(k)} = {n, n-1, ..., n-k+1} and b(k+1) = n-k where b(1..n) is row n of A088643, or k = 0 if no such k >= 1 exists.

Table of values

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

List of values

[0, 1, 1, 1, 4, 1, 1, 4, 1, 1, 4, 1, 6, 12, 1, 1, 4, 6, 1, 8, 1, 1, 4, 1, 6, 22, 1, 9, 10, 1, 1, 4, 6, 1, 8, 1, 1, 4, 6, 1, 8, 1, 18, 9, 1, 9, 10, 16, 1, 18, 1, 1, 4, 1, 1, 4, 1, 6, 12, 11, 27, 14, 62, 1, 17, 1, 18, 18, 1, 1, 4, 6, 8, 10, 1, 1, 4, 6, 1, 8, 19]