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.

A241581 Row sums in triangle A241580.

This page as a plain text file.
%I A241581 #13 Jul 30 2014 07:13:26
%S A241581 1,1,8,54,584,7350,114162,2053688,42513984,991883610,25807006730,
%T A241581 740614555692,23250961252752,792694751381078,29169262097277330,
%U A241581 1152329533163353680,48645406703597457152,2185462919071085059890,104113841197940277430554,5242449827954998459195220
%N A241581 Row sums in triangle A241580.
%H A241581 Alois P. Heinz, <a href="/A241581/b241581.txt">Table of n, a(n) for n = 1..200</a>
%H A241581 R. K. Guy, <a href="/A241580/a241580_1.pdf">Letter to N. J. A. Sloane, Jun 21, 1975</a>
%F A241581 a(n) = (n^n-A241580(n+1,1))/n.
%F A241581 a(n) = A245687(n,1)/n. - _Alois P. Heinz_, Jul 29 2014
%p A241581 M:=20;
%p A241581 T[1,1]:=1:
%p A241581 for n from 2 to M do
%p A241581    T[n,n]:=(n-1)^(n-1);
%p A241581    for k from n-1 by -1 to 1 do
%p A241581       T[n,k]:=T[n,k+1]-(n-1)*T[n-1,k]:
%p A241581 od:
%p A241581 od:
%p A241581 f:=n->(n^n-T[n+1,1])/n;[seq(f(n),n=1..M-1)];
%Y A241581 Cf. A241580, A231797, A245687.
%K A241581 nonn
%O A241581 1,3
%A A241581 _N. J. A. Sloane_, Apr 29 2014