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.

A085604 T(n,k) = highest power of prime(k) dividing n!, read by rows.

Table of values

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

List of values

[0, 1, 0, 1, 1, 0, 3, 1, 0, 0, 3, 1, 1, 0, 0, 4, 2, 1, 0, 0, 0, 4, 2, 1, 1, 0, 0, 0, 7, 2, 1, 1, 0, 0, 0, 0, 7, 4, 1, 1, 0, 0, 0, 0, 0, 8, 4, 2, 1, 0, 0, 0, 0, 0, 0, 8, 4, 2, 1, 1, 0, 0, 0, 0, 0, 0, 10, 5, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 10, 5, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 11, 5, 2, 2, 1, 1, 0, 0, 0]