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.

A286709 For k>0, let bin(k) = the string corresponding to the binary representation of k, and neg(k) = bin(k) under the character substitution '0' <-> '1'; a(n) = the smallest positive integer not occurring earlier in the sequence such that bin(Sum_{k=1..n} a(k)) contains neg(n) as a substring.

Table of values

n a(n)
1 2
2 3
3 4
4 10
5 1
6 5
7 7
8 14
9 8
10 15
11 11
12 19
13 31
14 6
15 24
16 28
17 18
18 12
19 50
20 32
21 30
22 9
23 21
24 38
25 13
26 42
27 63
28 20
29 16
30 25
31 64
32 61
33 51
34 44
35 27
36 35
37 89
38 37
39 87
40 39
41 85
42 41
43 83
44 17
45 107
46 45
47 79
48 29
49 52
50 92
51 75
52 22
53 102
54 53
55 71
56 40
57 43
58 34
59 23
60 103
61 127
62 128
63 62
64 188
65 66
66 60

List of values

[2, 3, 4, 10, 1, 5, 7, 14, 8, 15, 11, 19, 31, 6, 24, 28, 18, 12, 50, 32, 30, 9, 21, 38, 13, 42, 63, 20, 16, 25, 64, 61, 51, 44, 27, 35, 89, 37, 87, 39, 85, 41, 83, 17, 107, 45, 79, 29, 52, 92, 75, 22, 102, 53, 71, 40, 43, 34, 23, 103, 127, 128, 62, 188, 66, 60]