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.

A092990 Least product of the partitions of n into two parts with maximal tau value: let n = a+b be a partition of n, then a(n) = a*b such that tau(a*b) is maximal.

Table of values

n a(n)
2 1
3 2
4 4
5 6
6 8
7 12
8 12
9 18
10 24
11 24
12 36
13 36
14 48
15 36
16 60
17 60
18 72
19 60
20 84
21 90
22 120
23 120
24 144
25 144
26 120
27 180
28 180
29 180
30 216
31 240
32 240
33 252
34 240
35 300
36 180
37 336
38 360
39 360
40 336
41 420
42 360
43 420
44 420
45 504
46 360
47 420
48 540
49 360
50 504
51 540
52 420
53 360
54 720
55 600
56 720
57 540
58 840
59 840

List of values

[1, 2, 4, 6, 8, 12, 12, 18, 24, 24, 36, 36, 48, 36, 60, 60, 72, 60, 84, 90, 120, 120, 144, 144, 120, 180, 180, 180, 216, 240, 240, 252, 240, 300, 180, 336, 360, 360, 336, 420, 360, 420, 420, 504, 360, 420, 540, 360, 504, 540, 420, 360, 720, 600, 720, 540, 840, 840]