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.

A002021 Pile of coconuts problem: (n-1)*(n^n - 1), n even; n^n - n + 1, n odd.

Table of values

n a(n)
1 1
2 3
3 25
4 765
5 3121
6 233275
7 823537
8 117440505
9 387420481
10 89999999991
11 285311670601
12 98077104930805
13 302875106592241
14 144456088732254195
15 437893890380859361
16 276701161105643274225
17 827240261886336764161
18 668888937280041138782191
19 1978419655660313589123961

List of values

[1, 3, 25, 765, 3121, 233275, 823537, 117440505, 387420481, 89999999991, 285311670601, 98077104930805, 302875106592241, 144456088732254195, 437893890380859361, 276701161105643274225, 827240261886336764161, 668888937280041138782191, 1978419655660313589123961]