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.

A386987 For n >= 2, a(n) is the least r >= 1 such that T(n - r) + ... + T(n - 1) = T(n + 1) + ... + T(n + r) where T(i) is A010060(i).

Table of values

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

List of values

[2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 4, 3, 3, 4, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 4, 3, 3]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.