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.

A025771 Expansion of 1/((1-x)*(1-x^3)*(1-x^11)).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 10, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 29, 30, 31, 33, 34, 35, 37, 38, 40, 42, 43, 45, 47, 48, 50, 52, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 82, 84, 86, 89
Offset: 0

Views

Author

Keywords

Comments

a(n) is the number of partitions of n into parts 1, 3, and 11. - Joerg Arndt, Aug 20 2025

Programs

Formula

a(n) = +a(n-1) +a(n-3) -a(n-4) +a(n-11) -a(n-12) -a(n-14) +a(n-15). - R. J. Mathar, Aug 21 2014
a(n) = floor((n^2 + 15*n + 78)/66). - Hoang Xuan Thanh, Aug 18 2025