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.
%I A375957 #8 Sep 04 2024 15:15:50 %S A375957 1,1,0,0,0,0,1,0,0,1,5,6,0,1,5005,0,32352,215511,1,160,1600,1937, %T A375957 52374735,11374351128,100368000,248032486000,677497393,5166569025792, %U A375957 84527951721264,154849134310100,774245674466500,18868327574531760,201758301050363904,40887062103450025 %N A375957 Number of partitions of [n] such that the element sum of each block is one more than a multiple of ten. %H A375957 Alois P. Heinz, <a href="/A375957/b375957.txt">Table of n, a(n) for n = 0..35</a> %H A375957 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a> %e A375957 a(6) = 1: 123456. %e A375957 a(9) = 1: 1|29|38|47|56. %e A375957 a(10) = 5: 1(10)|29|38|47|56, 1|29(10)|38|47|56, 1|29|38(10)|47|56, 1|29|38|47(10)|56, 1|29|38|47|56(10). %e A375957 a(11) = 6: 1(10)|29|38|47|56|(11), 1|29(10)|38|47|56|(11), 1|29|38(10)|47|56|(11), 1|29|38|47(10)|56|(11), 1|29|38|47|56(10)|(11), 1|29|38|47|56|(10)(11). %Y A375957 Column k=10 of A375924. %K A375957 nonn %O A375957 0,11 %A A375957 _Alois P. Heinz_, Sep 03 2024