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.

A351380 Table read by rows: T(n,k) is the number of integers in the interval [2^(n-1), 2^n - 1] that have the k-th least prime signature.

Table of values

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

List of values

[1, 0, 2, 0, 2, 1, 1, 0, 2, 1, 3, 1, 1, 0, 5, 1, 3, 1, 3, 1, 1, 1, 0, 7, 1, 11, 0, 5, 0, 3, 1, 1, 1, 1, 1, 0, 13, 1, 19, 1, 9, 1, 2, 7, 0, 1, 2, 3, 1, 2, 1, 1, 0, 23, 1, 39, 0, 14, 0, 8, 16, 1, 2, 3, 9, 0, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 0, 43, 2, 73, 1, 27, 0, 11, 37, 0, 2, 6, 20, 0, 2, 3, 8, 0, 2, 4, 2, 4, 0, 1, 1, 1, 2, 1, 1, 1, 1]