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.

A154425 a(n) = A142458(n, 1 + floor(n/2)).

This page as a plain text file.
%I A154425 #6 Mar 17 2022 01:10:46
%S A154425 1,1,8,39,546,5482,109640,1709675,44451550,947113254,30307624128,
%T A154425 821539580358,31218504053604,1028949571999572,45273781167981168,
%U A154425 1758747856988046771,87937392849402338550,3935893923685215214030
%N A154425 a(n) = A142458(n, 1 + floor(n/2)).
%H A154425 G. C. Greubel, <a href="/A154425/b154425.txt">Table of n, a(n) for n = 1..375</a>
%F A154425 a(n) = A142458(n, 1 + floor(n/2)).
%t A154425 T[n_, k_, m_]:= T[n, k, m]= If[k==1 || k==n, 1, (m*n-m*k+1)*T[n-1, k-1, m] + (m*k-m+1)*T[n-1, k, m]];
%t A154425 A154425[n_]:= T[n, 1+Floor[n/2], 3];
%t A154425 Table[A154425[n], {n, 30}] (* modified by _G. C. Greubel_, Mar 16 2022 *)
%o A154425 (Sage)
%o A154425 @CachedFunction
%o A154425 def T(n,k,m): # A142458
%o A154425     if (k==1 or k==n): return 1
%o A154425     else: return (m*(n-k)+1)*T(n-1,k-1,m) + (m*k-m+1)*T(n-1,k,m)
%o A154425 def A154425(n): return T(n, 1 + (n//2), 3)
%o A154425 [A154425(n) for n in (1..30)] # _G. C. Greubel_, Mar 16 2022
%Y A154425 Cf. A142458.
%K A154425 nonn
%O A154425 1,3
%A A154425 _Roger L. Bagula_, Jan 09 2009
%E A154425 Edited by _G. C. Greubel_, Mar 16 2022