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.

A157522 Triangle T(n, k) = f(n, k) + f(n, n-k) - 1, where f(n, k) = k if k <= floor(n/4), floor(n/2) - k if floor(n/4) < k <= floor(n/2), k - floor(n/2) if floor(n/2) < k <= floor(3*n/4), otherwise n-k, read by rows.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 1, 3, 1, 1, 3, 2, 2, 3, 1, 1, 3, 3, 1, 3, 3, 1, 1, 3, 4, 2, 2, 4, 3, 1, 1, 3, 5, 3, 1, 3, 5, 3, 1, 1, 3, 5, 4, 2, 2, 4, 5, 3, 1, 1, 3, 5, 5, 3, 1, 3, 5, 5, 3, 1, 1, 3, 5, 6, 4, 2, 2, 4, 6, 5, 3, 1, 1, 3, 5, 7, 5, 3, 1, 3, 5, 7, 5, 3, 1, 1, 3, 5, 7, 6, 4, 2, 2, 4, 6, 7, 5, 3, 1]