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.

A239169 Number of partitions of 10^n into parts that are at most n with at least one part of each size.

Table of values

n a(n)
0 0
1 1
2 49
3 82834
4 6934032777
5 34711806631898612
6 11573466447067793596124382
7 275570877432663678053361428346732364
8 492094366103239904094628894222685729680850442491
9 68346513550765879549763426703232180189170804739067223698078512

List of values

[0, 1, 49, 82834, 6934032777, 34711806631898612, 11573466447067793596124382, 275570877432663678053361428346732364, 492094366103239904094628894222685729680850442491, 68346513550765879549763426703232180189170804739067223698078512]

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

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