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.

A328898 Sum of p-ary comparisons units required to rank a sequence in parallel when the sequence is partitioned into heaps equal to the prime factors p of the initial sequence length n.

Table of values

n a(n)
1 0
2 1
3 1
4 6
5 1
6 11
7 1
8 28
9 12
10 27
11 1
12 58
13 1
14 51
15 28
16 120
17 1
18 105
19 1
20 154
21 52
22 123
23 1
24 260
25 30
26 171
27 117
28 298
29 1
30 281
31 1
32 496
33 124
34 291
35 54
36 534
37 1
38 363
39 172
40 708
41 1
42 545
43 1
44 730
45 309
46 531
47 1
48 1096
49 56
50 685
51 292
52 1018
53 1
54 963
55 126
56 1380
57 364
58 843
59 1
60 1462
61 1
62 963
63 597
64 2016
65 174
66 1337
67 1
68 1738
69 532
70 1333
71 1
72 2364
73 1
74 1371
75 715
76 2170
77 128
78 1865

List of values

[0, 1, 1, 6, 1, 11, 1, 28, 12, 27, 1, 58, 1, 51, 28, 120, 1, 105, 1, 154, 52, 123, 1, 260, 30, 171, 117, 298, 1, 281, 1, 496, 124, 291, 54, 534, 1, 363, 172, 708, 1, 545, 1, 730, 309, 531, 1, 1096, 56, 685, 292, 1018, 1, 963, 126, 1380, 364, 843, 1, 1462, 1, 963, 597, 2016, 174, 1337, 1, 1738, 532, 1333, 1, 2364, 1, 1371, 715, 2170, 128, 1865]