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.

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

This page as a plain text file.
%I A244246 #8 Jul 28 2025 03:22:08
%S A244246 1,10,46,139,329,660,1173,1918,2938,4277,5990,8123,10742,13903,17678,
%T A244246 22140,27383,33487,40560,48710,58055,68734,80881,94657,110223,127771,
%U A244246 147478,169580,194278,221842,252503,286579,324327,366120,412247,463132,519112,580667
%N A244246 Number of partitions of n into 10 parts such that every i-th smallest part (counted with multiplicity) is different from i.
%H A244246 Alois P. Heinz, <a href="/A244246/b244246.txt">Table of n, a(n) for n = 65..1000</a>
%H A244246 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 A244246 Column k=10 of A238406.
%K A244246 nonn
%O A244246 65,2
%A A244246 _Alois P. Heinz_, Jun 23 2014