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.

A074206 Kalmár's [Kalmar's] problem: number of ordered factorizations of n.

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 8, 1, 3, 3, 8, 1, 8, 1, 8, 3, 3, 1, 20, 2, 3, 4, 8, 1, 13, 1, 16, 3, 3, 3, 26, 1, 3, 3, 20, 1, 13, 1, 8, 8, 3, 1, 48, 2, 8, 3, 8, 1, 20, 3, 20, 3, 3, 1, 44, 1, 3, 8, 32, 3, 13, 1, 8, 3, 13, 1, 76, 1, 3, 8, 8, 3, 13, 1, 48, 8, 3, 1, 44, 3, 3, 3, 20, 1, 44, 3, 8, 3, 3, 3, 112]