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.

A141404 Irregular array: For any prime p that divides n, if the highest power of the prime p that divides n is p^b(n,p), then p^b(n,p) = Sum_{k=1..m} a(n,k), where m is the order of the prime-power p^b(n,p) among the prime-powers (each being the highest power of each prime q that divides n, where q divides n) when they are ordered by size. Row 1 = (1).

Table of values

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

List of values

[1, 2, 3, 4, 5, 2, 1, 7, 8, 9, 2, 3, 11, 3, 1, 13, 2, 5, 3, 2, 16, 17, 2, 7, 19, 4, 1, 3, 4, 2, 9, 23, 3, 5, 25, 2, 11, 27, 4, 3, 29, 2, 1, 2, 31, 32, 3, 8, 2, 15, 5, 2, 4, 5, 37, 2, 17, 3, 10, 5, 3, 41, 2, 1, 4, 43, 4, 7, 5, 4, 2, 21, 47, 3, 13, 49, 2, 23, 3, 14, 4, 9, 53, 2, 25, 5, 6, 7, 1, 3, 16, 2]