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.

A074703 a(n) = n^2*a(n-1)+1, a(1)=0.

This page as a plain text file.
%I A074703 #10 Feb 19 2014 15:53:12
%S A074703 0,1,10,161,4026,144937,7101914,454522497,36816322258,3681632225801,
%T A074703 445477499321922,64148759902356769,10841140423498293962,
%U A074703 2124863523005665616553,478094292676274763724426
%N A074703 a(n) = n^2*a(n-1)+1, a(1)=0.
%H A074703 Harvey P. Dale, <a href="/A074703/b074703.txt">Table of n, a(n) for n = 1..253</a>
%F A074703 a(n) = round(n!^2*(BesselI(0, 2)-2)).
%t A074703 nxt[{n_,a_}]:={n+1,(n+1)^2 a+1}; Transpose[NestList[nxt,{1,0},20]][[2]] (* _Harvey P. Dale_, Dec 11 2013 *)
%o A074703 (PARI) a(n)=round((besseli(0,2)-2)*n!^2) \\ _Charles R Greathouse IV_, Feb 19 2014
%Y A074703 Cf. A006040, A073701.
%K A074703 easy,nonn
%O A074703 1,3
%A A074703 _Vladeta Jovovic_, Sep 03 2002