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.

A246793 a(n) is the largest m such that A182134(n - k) = k for A246785(n) <= k <= m, or zero if there is no such m.

Table of values

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

List of values

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