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.

A276379 Write a "1" for each distinct prime divisor p of n in the (pi(p) - 1)-th place, ignoring multiplicity.

Table of values

n a(n)
1 0
2 1
3 10
4 1
5 100
6 11
7 1000
8 1
9 10
10 101
11 10000
12 11
13 100000
14 1001
15 110
16 1
17 1000000
18 11
19 10000000
20 101
21 1010
22 10001
23 100000000
24 11
25 100
26 100001
27 10
28 1001
29 1000000000
30 111
31 10000000000
32 1
33 10010
34 1000001
35 1100
36 11
37 100000000000
38 10000001
39 100010
40 101
41 1000000000000
42 1011
43 10000000000000
44 10001
45 110

List of values

[0, 1, 10, 1, 100, 11, 1000, 1, 10, 101, 10000, 11, 100000, 1001, 110, 1, 1000000, 11, 10000000, 101, 1010, 10001, 100000000, 11, 100, 100001, 10, 1001, 1000000000, 111, 10000000000, 1, 10010, 1000001, 1100, 11, 100000000000, 10000001, 100010, 101, 1000000000000, 1011, 10000000000000, 10001, 110]