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.

A210432 Number of semistandard Young tableaux over all partitions of 10 with maximal element <= n.

This page as a plain text file.
%I A210432 #19 Feb 08 2017 19:21:05
%S A210432 0,1,36,630,6512,45628,239316,1007083,3570240,11042199,30569012,
%T A210432 77221232,180646896,395884866,820217412,1618520277,3060257024,
%U A210432 5572071725,9810869508,16763347626,27879160048,45246275592,71818632820,111707913791,170553162816,255984075075
%N A210432 Number of semistandard Young tableaux over all partitions of 10 with maximal element <= n.
%H A210432 Bruno Berselli, <a href="/A210432/b210432.txt">Table of n, a(n) for n = 0..1000</a>
%H A210432 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%H A210432 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).
%F A210432 a(n) = n^2*(126432+(206020+(101031+(18930+1187*n^2)*n^2)*n^2)*n^2)/453600.
%F A210432 G.f.: -x*(x+1)*(x^8 +24*x^7 +265*x^6 +1132*x^5 +1904*x^4 +1132*x^3 +265*x^2 +24*x+1) / (x-1)^11.
%p A210432 a:= n-> n^2* (126432+ (206020+ (101031+ (18930+ 1187*n^2) *n^2) *n^2) *n^2)/ 453600:
%p A210432 seq(a(n), n=0..40);
%Y A210432 Row n=10 of A210391.
%K A210432 nonn,easy
%O A210432 0,3
%A A210432 _Alois P. Heinz_, Mar 21 2012