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.

A244245 Number of partitions of n into 9 parts such that every i-th smallest part (counted with multiplicity) is different from i.

This page as a plain text file.
%I A244245 #8 Jul 28 2025 08:59:53
%S A244245 1,9,37,101,220,410,684,1062,1553,2174,2943,3875,4995,6319,7876,9689,
%T A244245 11798,14219,17005,20179,23798,27894,32531,37743,43610,50169,57509,
%U A244245 65679,74778,84858,96036,108373,121997,136983,153471,171546,191373,213040,236731,262556
%N A244245 Number of partitions of n into 9 parts such that every i-th smallest part (counted with multiplicity) is different from i.
%H A244245 Alois P. Heinz, <a href="/A244245/b244245.txt">Table of n, a(n) for n = 54..1000</a>
%H A244245 N. Guru Sharan and Armin Straub, <a href="https://arxiv.org/abs/2507.19047">Partitions with Durfee triangles of fixed size</a>, arXiv:2507.19047 [math.CO], 2025. See p. 5.
%Y A244245 Column k=9 of A238406.
%K A244245 nonn
%O A244245 54,2
%A A244245 _Alois P. Heinz_, Jun 23 2014