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.

A069672 Largest n-digit triangular number with minimum digit sum.

Table of values

n a(n)
1 1
2 10
3 300
4 3003
5 20100
6 112101
7 2001000
8 33020001
9 200010000
10 3200120001
11 20000100000
12 320001200001
13 2000001000000
14 32000012000001
15 200000010000000
16 3200000120000001
17 20000000100000000
18 320000001200000001
19 2000000001000000000
20 32000000012000000001
21 200000000010000000000
22 3200000000120000000001
23 20000000000100000000000
24 320000000001200000000001
25 2000000000001000000000000
26 32000000000012000000000001
27 200000000000010000000000000
28 3200000000000120000000000001
29 20000000000000100000000000000
30 320000000000001200000000000001

List of values

[1, 10, 300, 3003, 20100, 112101, 2001000, 33020001, 200010000, 3200120001, 20000100000, 320001200001, 2000001000000, 32000012000001, 200000010000000, 3200000120000001, 20000000100000000, 320000001200000001, 2000000001000000000, 32000000012000000001, 200000000010000000000, 3200000000120000000001, 20000000000100000000000, 320000000001200000000001, 2000000000001000000000000, 32000000000012000000000001, 200000000000010000000000000, 3200000000000120000000000001, 20000000000000100000000000000, 320000000000001200000000000001]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.