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.

A114791 Consider the array T where the element at T(r,c) is the number of n-almost primes less than or equal to 2^m. Sequence read by successive columns beginning at r=c.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 4
7 1
8 2
9 6
10 6
11 1
12 2
13 7
14 10
15 11
16 1
17 2
18 7
19 13
20 22
21 18
22 1
23 2
24 7
25 14
26 30
27 42
28 31
29 1
30 2
31 7
32 15
33 34
34 60
35 82
36 54
37 1
38 2
39 7
40 15
41 36
42 71
43 125
44 157
45 97
46 1
47 2
48 7
49 15
50 37
51 77
52 152
53 256
54 304
55 172
56 1
57 2
58 7
59 15
60 37
61 81
62 168
63 325
64 513
65 589
66 309
67 1
68 2
69 7
70 15
71 37
72 83
73 177
74 367
75 669
76 1049

List of values

[1, 1, 2, 1, 2, 4, 1, 2, 6, 6, 1, 2, 7, 10, 11, 1, 2, 7, 13, 22, 18, 1, 2, 7, 14, 30, 42, 31, 1, 2, 7, 15, 34, 60, 82, 54, 1, 2, 7, 15, 36, 71, 125, 157, 97, 1, 2, 7, 15, 37, 77, 152, 256, 304, 172, 1, 2, 7, 15, 37, 81, 168, 325, 513, 589, 309, 1, 2, 7, 15, 37, 83, 177, 367, 669, 1049]