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.

A065071 Minimum number of identical bricks of length 1 which, when stacked without mortar in the naive way, form a stack of length >=n.

Table of values

n a(n)
1 1
2 5
3 32
4 228
5 1675
6 12368
7 91381
8 675215
9 4989192
10 36865413
11 272400601
12 2012783316
13 14872568832
14 109894245430
15 812014744423
16 6000022499694
17 44334502845081
18 327590128640501
19 2420581837980562
20 17885814992891027

List of values

[1, 5, 32, 228, 1675, 12368, 91381, 675215, 4989192, 36865413, 272400601, 2012783316, 14872568832, 109894245430, 812014744423, 6000022499694, 44334502845081, 327590128640501, 2420581837980562, 17885814992891027]