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.

A143086 Triangle read by rows: T(n,k) = 2^(k + 1) - 1 if k < = floor(n/2), otherwise 2^(n - k + 1) - 1, for 0 <= k <= n.

Table of values

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

List of values

[1, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 3, 7, 3, 1, 1, 3, 7, 7, 3, 1, 1, 3, 7, 15, 7, 3, 1, 1, 3, 7, 15, 15, 7, 3, 1, 1, 3, 7, 15, 31, 15, 7, 3, 1, 1, 3, 7, 15, 31, 31, 15, 7, 3, 1, 1, 3, 7, 15, 31, 63, 31, 15, 7, 3, 1, 1, 3, 7, 15, 31, 63, 63, 31, 15, 7, 3, 1, 1, 3, 7, 15, 31, 63, 127, 63, 31, 15, 7, 3, 1]