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.

A116433 Consider the array T(r,c) where is the number of c-almost primes less than or equal to r^c, r >= 1, c >= 0. Read the array by antidiagonals.

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 0
10 1
11 2
12 3
13 1
14 0
15 1
16 3
17 6
18 5
19 1
20 0
21 1
22 3
23 9
24 13
25 8
26 1
27 0
28 1
29 4
30 13
31 30
32 34
33 14
34 1
35 0
36 1
37 4
38 17
39 50
40 90
41 77
42 23
43 1
44 0
45 1
46 4
47 22
48 82
49 200
50 269
51 177
52 39
53 1
54 0
55 1
56 4
57 26
58 125
59 385
60 726
61 788
62 406
63 64
64 1
65 0
66 1
67 5
68 34
69 181
70 669
71 1688
72 2613
73 2249
74 887
75 103
76 1
77 0
78 1
79 5

List of values

[0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 3, 1, 0, 1, 3, 6, 5, 1, 0, 1, 3, 9, 13, 8, 1, 0, 1, 4, 13, 30, 34, 14, 1, 0, 1, 4, 17, 50, 90, 77, 23, 1, 0, 1, 4, 22, 82, 200, 269, 177, 39, 1, 0, 1, 4, 26, 125, 385, 726, 788, 406, 64, 1, 0, 1, 5, 34, 181, 669, 1688, 2613, 2249, 887, 103, 1, 0, 1, 5]