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.

A384224 Irregular triangle read by rows: T(n,k) is the number of divisors in the k-th sublist of the divisors of n formed by the k-th odd divisor and the next even divisors that are less than the next odd divisor of n, with n >= 1, k >= 1.

Table of values

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

List of values

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