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.

A059941 Take the n-th number which is just a sequence of 1's and 2's (A007931): if the first k digits in order are the same as the last k digits in order then put 1 in the k-th from right digit of a(n), otherwise put a zero.

Table of values

n a(n)
1 1
2 1
3 11
4 10
5 10
6 11
7 111
8 100
9 101
10 100
11 100
12 101
13 100
14 111
15 1111
16 1000
17 1001
18 1000
19 1001
20 1010
21 1001
22 1000
23 1000
24 1001
25 1010
26 1001
27 1000
28 1001
29 1000
30 1111
31 11111
32 10000
33 10001
34 10000
35 10011
36 10000
37 10001
38 10000
39 10001
40 10010
41 10101
42 10000

List of values

[1, 1, 11, 10, 10, 11, 111, 100, 101, 100, 100, 101, 100, 111, 1111, 1000, 1001, 1000, 1001, 1010, 1001, 1000, 1000, 1001, 1010, 1001, 1000, 1001, 1000, 1111, 11111, 10000, 10001, 10000, 10011, 10000, 10001, 10000, 10001, 10010, 10101, 10000]