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.

A182471 If n = Product (p_j^k_j), j=1 to m, then a(n) = Floor( Sum (p_j + k_j) / 2m ) (a(1) = 0 by convention).

Table of values

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

List of values

[0, 1, 2, 2, 3, 1, 4, 2, 2, 2, 6, 2, 7, 2, 2, 3, 9, 2, 10, 2, 3, 3, 12, 2, 3, 4, 3, 3, 15, 2, 16, 3, 4, 5, 3, 2, 19, 5, 4, 2, 21, 2, 22, 4, 2, 6, 24, 2, 4, 2, 5, 4, 27, 2, 4, 3, 6, 8, 30, 2, 31, 8, 3, 4, 5, 3, 34, 5, 7, 2, 36, 2, 37, 10, 2, 6, 5, 3, 40, 3, 3]