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.

A238635 Number of partitions of 8^n into parts that are at most 8.

Original entry on oeis.org

1, 22, 116263, 57733506640, 98149884074667116, 200386212932492140762672, 418829370245413954052212657987, 877979540384895591800176962368065072, 1841159754991692001851990839259642586671980, 3861166489120966379893685013624485791901912419888
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Row n=8 of A238016.

Formula

a(n) = [x^(8^n)] Product_{j=1..8} 1/(1-x^j).