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.

A214771 a(n) is the smallest number that can be written as the sum of consecutive positive integers in at least n ways.

Table of values

n a(n)
1 3
2 9
3 15
4 45
5 45
6 105
7 105
8 225
9 315
10 315
11 315
12 945
13 945
14 945
15 945
16 1575
17 1575
18 2835
19 2835
20 3465
21 3465
22 3465
23 3465
24 10395
25 10395
26 10395
27 10395
28 10395
29 10395
30 10395
31 10395
32 17325
33 17325
34 17325
35 17325
36 31185
37 31185
38 31185
39 31185
40 45045
41 45045
42 45045
43 45045

List of values

[3, 9, 15, 45, 45, 105, 105, 225, 315, 315, 315, 945, 945, 945, 945, 1575, 1575, 2835, 2835, 3465, 3465, 3465, 3465, 10395, 10395, 10395, 10395, 10395, 10395, 10395, 10395, 17325, 17325, 17325, 17325, 31185, 31185, 31185, 31185, 45045, 45045, 45045, 45045]