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 A229361 #4 Sep 20 2013 21:18:32
%S A229361 192,420,1494,7686,49218,358710,2838234,23736846,206418978,1846772550,
%T A229361 16877063274,156755849406,1474458820338,14008019814390,
%U A229361 134151794416314,1293111887664366,12531051927887298,121969635737464230,1191547891970937354,11676481763813277726
%N A229361 Total sum of n-th powers of parts in all partitions of 10.
%H A229361 Alois P. Heinz, <a href="/A229361/b229361.txt">Table of n, a(n) for n = 0..500</a>
%F A229361 a(n) = Sum_{k=1..10} A066633(10,k) * k^n.
%F A229361 a(n) = 97+41*2^n+21*3^n+13*4^n+8*5^n+5*6^n+3*7^n+2*8^n+9^n+10^n.
%F A229361 G.f.: -6*(79272960*x^9 -165073604*x^8 +144452636*x^7 -70246061*x^6 +21041460*x^5 -4044664*x^4 +500814*x^3 -38639*x^2 +1690*x -32) / Product_{j=1..10} (j*x-1).
%p A229361 a:= n-> 97+41*2^n+21*3^n+13*4^n+8*5^n+5*6^n+3*7^n+2*8^n+9^n+10^n:
%p A229361 seq(a(n), n=0..30);
%Y A229361 Row n=10 of A213191.
%K A229361 nonn,easy
%O A229361 0,1
%A A229361 _Alois P. Heinz_, Sep 20 2013