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 A229358 #4 Sep 20 2013 20:46:28 %S A229358 54,105,311,1281,6407,35745,212951,1323441,8464487,55247745,365983991, %T A229358 2451448401,16559916167,112602093345,769628452631,5282089330161, %U A229358 36372360161447,251135368228545,1737811434946871,12047233511096721,83642479068080327,581449745964789345 %N A229358 Total sum of n-th powers of parts in all partitions of 7. %H A229358 Alois P. Heinz, <a href="/A229358/b229358.txt">Table of n, a(n) for n = 0..500</a> %F A229358 a(n) = Sum_{k=1..7} A066633(7,k) * k^n. %F A229358 a(n) = 30 + 11*2^n + 6*3^n + 3*4^n + 2*5^n + 6^n + 7^n. %F A229358 G.f.: -(196356*x^6 -339112*x^5 +230407*x^4 -79457*x^3 +14759*x^2 -1407*x +54) / Product_{j=1..7} (j*x-1). %p A229358 a:= n-> 30+11*2^n+6*3^n+3*4^n+2*5^n+6^n+7^n: %p A229358 seq(a(n), n=0..30); %Y A229358 Row n=7 of A213191. %K A229358 nonn,easy %O A229358 0,1 %A A229358 _Alois P. Heinz_, Sep 20 2013