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.

A309202 Peter Munn showed in A111273 that if A111273(n)=m then if m is odd, n <= m, and if m is even, n <= 2*m-1; a(n) is either m-n or 2*m-1-n in the two cases.

Table of values

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

List of values

[0, 1, 0, 1, 10, 1, 0, 3, 0, 1, 32, 1, 78, 7, 0, 1, 34, 1, 0, 7, 12, 1, 0, 15, 0, 1, 8, 1, 58, 1, 0, 15, 154, 1, 24, 1, 666, 1, 12, 1, 82, 1, 128, 1, 24, 1, 140, 7, 0, 25, 16, 1, 106, 1, 32, 19, 0, 1, 176, 1, 1830, 1, 0, 15, 0, 1, 200, 23, 36, 1, 0, 1, 2628, 37, 24, 1, 66, 1, 236, 27, 0, 1, 0, 55, 0, 43]