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.

A375957 Number of partitions of [n] such that the element sum of each block is one more than a multiple of ten.

Table of values

n a(n)
0 1
1 1
2 0
3 0
4 0
5 0
6 1
7 0
8 0
9 1
10 5
11 6
12 0
13 1
14 5005
15 0
16 32352
17 215511
18 1
19 160
20 1600
21 1937
22 52374735
23 11374351128
24 100368000
25 248032486000
26 677497393
27 5166569025792
28 84527951721264
29 154849134310100
30 774245674466500
31 18868327574531760
32 201758301050363904
33 40887062103450025

List of values

[1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 5, 6, 0, 1, 5005, 0, 32352, 215511, 1, 160, 1600, 1937, 52374735, 11374351128, 100368000, 248032486000, 677497393, 5166569025792, 84527951721264, 154849134310100, 774245674466500, 18868327574531760, 201758301050363904, 40887062103450025]