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.

A238567 Number of partitions of 10^n into parts that are at most n.

Table of values

n a(n)
0 0
1 1
2 51
3 83834
4 6954866112
5 34732639965323612
6 11574681724845786651679939
7 275575507062293332528670070330578043
8 492095606182604983628979092635386202795929807572
9 68346538155515186680097859376764556127526656338966443473179293

List of values

[0, 1, 51, 83834, 6954866112, 34732639965323612, 11574681724845786651679939, 275575507062293332528670070330578043, 492095606182604983628979092635386202795929807572, 68346538155515186680097859376764556127526656338966443473179293]

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

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