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 A229356 #4 Sep 20 2013 20:04:06
%S A229356 20,35,87,287,1119,4775,21447,99407,470319,2256695,10936407,53384927,
%T A229356 261997119,1291033415,6381582567,31620148847,156969213519,
%U A229356 780378126935,3884192631927,19350690855167,96473921031519,481256133809255,2401840755956487,11991486019167887
%N A229356 Total sum of n-th powers of parts in all partitions of 5.
%H A229356 Alois P. Heinz, <a href="/A229356/b229356.txt">Table of n, a(n) for n = 0..1000</a>
%F A229356 a(n) = Sum_{k=1..5} A066633(5,k) * k^n.
%F A229356 a(n) = 12 + 4*2^n + 2*3^n + 4^n + 5^n.
%F A229356 G.f.: -(1814*x^4-2543*x^3+1262*x^2-265*x+20) / ((x-1) *(2*x-1) *(3*x-1) *(4*x-1) *(5*x-1)).
%p A229356 a:= n-> 12+4*2^n+2*3^n+4^n+5^n:
%p A229356 seq(a(n), n=0..30);
%Y A229356 Row n=5 of A213191.
%K A229356 nonn,easy
%O A229356 0,1
%A A229356 _Alois P. Heinz_, Sep 20 2013