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.

A318056 Let b(1) = b(2) = 1; for n >= 3, b(n) = n - b(t(n)) - b(n-t(n-1)) where t = A004001. a(n) = 2*b(n) - n.

Table of values

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

List of values

[1, 0, -1, 0, 1, 0, 1, 0, -3, -2, -3, -2, -1, 0, -1, 0, 5, 4, 5, 4, 5, 2, 1, 2, 3, 4, 3, 0, 1, 0, 1, 0, -11, -10, -11, -10, -11, -10, -7, -6, -7, -6, -9, -10, -9, -8, -7, -8, -3, -4, -3, -2, -1, -2, -5, -4, -5, -4, -1, 0, -1, 0, -1, 0, 21, 20, 21, 20, 21, 20, 21, 16, 15, 16, 15, 16, 19, 20, 19, 20]

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

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