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.

A363211 Number of partitions of n such that 3*(least part) <= greatest part.

This page as a plain text file.
%I A363211 #16 Aug 03 2025 12:50:53
%S A363211 0,0,0,1,2,4,7,12,18,27,39,56,78,106,143,193,254,333,432,560,717,914,
%T A363211 1157,1461,1833,2292,2849,3536,4362,5372,6587,8062,9825,11951,14487,
%U A363211 17533,21150,25469,30583,36670,43850,52357,62366,74184,88048,104359,123442,145826,171946,202487
%N A363211 Number of partitions of n such that 3*(least part) <= greatest part.
%F A363211 G.f.: Sum_{i>=1} Sum_{j>=0} x^(4*i+j) /Product_{k=i..3*i+j} (1-x^k).
%t A363211 Table[Count[IntegerPartitions[n],_?(3#[[-1]]<=#[[1]]&)],{n,50}] (* _Harvey P. Dale_, Aug 03 2025 *)
%Y A363211 Cf. A237821, A363276.
%Y A363211 Cf. A237825, A363075.
%K A363211 nonn
%O A363211 1,5
%A A363211 _Seiichi Manyama_, May 27 2023