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.

A146292 Triangle T(n,m) read by rows (n >= 1, 0 <= m <= A036041(n)), giving the number of divisors of A025487(n) with m prime factors (counted with multiplicity).

Table of values

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

List of values

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