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 A096047 #13 Oct 21 2022 22:04:30
%S A096047 1,22,346,5482,87466,1398442,22370986,357919402,5726644906,
%T A096047 91626056362,1466015853226,23456249457322,375299974539946,
%U A096047 6004799525530282,96076792140049066,1537228673167043242,24595658766377724586
%N A096047 a(n)=B(2n,4)/B(2n) (see comment).
%C A096047 B(n,p)=sum(i=0,n,p^i*sum(j=0,i,binomial(n,j)*B(j))) where B(k)=k-th Bernoulli number
%H A096047 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (21,-84,64).
%F A096047 a(n)=(1/3)*(4*16^n+4^n-2); a(0)=1, a(1)=22, a(2)=346 and a(n)=21*a(n-1)-84*a(n-2)+64*a(n-3)
%t A096047 LinearRecurrence[{21,-84,64},{1,22,346},20] (* _Harvey P. Dale_, Oct 13 2016 *)
%o A096047 (PARI) a(n)=sum(i=0,2*n,4^i*sum(j=0,i,binomial(2*n,j)*bernfrac(j)))/bernfrac(2*n)
%o A096047 (Maxima) a[0]:1$ a[1]:22$ a[2]:346$ a[n]:=(1/3)*(4*16^n+4^n-2)$ A096047(n):=a[n]$ makelist(A096047(n),n,0,30); /* _Martin Ettl_, Nov 13 2012 */
%Y A096047 Cf. A096045, A096046, A096048.
%K A096047 nonn,easy
%O A096047 0,2
%A A096047 _Benoit Cloitre_, Jun 17 2004