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.

A175045 a(n) = number of distinct values k of substrings in binary n where both k is prime and A030101(k) is prime.

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 1, 2, 0, 0, 1, 3, 1, 3, 2, 2, 0, 1, 0, 1, 1, 1, 3, 5, 1, 1, 3, 4, 2, 5, 2, 3, 0, 0, 1, 2, 0, 2, 1, 2, 1, 2, 1, 4, 3, 4, 5, 6, 1, 2, 1, 1, 3, 4, 4, 6, 2, 2, 5, 6, 2, 6, 3, 3, 0, 0, 0, 2, 1, 2, 2, 4, 0, 1, 2, 4, 1, 3, 2, 2, 1, 2, 2, 4, 1, 1, 4, 6, 3, 3, 4, 4, 5, 7, 6, 7, 1, 2, 2, 2, 1, 4, 1, 2, 3]