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.

A328448 Smallest number whose divisors > 1 have a longest run of length n, and 0 if none exists.

Table of values

n a(n)
1 2
2 6
3 12
4 504
5 60
6 420
7 840
8 4084080
9 2520
10 21162960
11 27720
12 2059318800
13 0
14 360360
15 720720
16 8494326640800
17 12252240
18 281206918792800
19 0
20 0
21 232792560
22 409547311252279200
23 5354228880
24 619808900849199341280
25 26771144400
26 54749786241679275146400
27 80313433200
28 5663770990518545704800

List of values

[2, 6, 12, 504, 60, 420, 840, 4084080, 2520, 21162960, 27720, 2059318800, 0, 360360, 720720, 8494326640800, 12252240, 281206918792800, 0, 0, 232792560, 409547311252279200, 5354228880, 619808900849199341280, 26771144400, 54749786241679275146400, 80313433200, 5663770990518545704800]