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.

A146289 Triangle T(n,m) read by rows (n >= 1, 0 <= m <= A001221(n)), giving the number of divisors of n with m distinct prime factors.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 3, 2, 1, 1, 1, 3, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 4, 3, 1, 2, 1, 2, 1, 1, 3, 1, 3, 2, 1, 1, 1, 3, 3, 1, 1, 1, 1, 5, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 4, 4, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4, 3, 1, 1, 1, 3, 3]