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 A026627 #8 Jun 19 2024 16:49:49
%S A026627 1,3,8,28,98,354,1300,4834,18142,68578,260720,995856,3818644,14690940,
%T A026627 56677652,219195454,849523318,3298629106,12829651312,49973834584,
%U A026627 194917940188,761178474076,2975764881352,11645184195364
%N A026627 a(n) = A026626(2*n, n).
%H A026627 G. C. Greubel, <a href="/A026627/b026627.txt">Table of n, a(n) for n = 0..1000</a>
%F A026627 a(n) = ( (357*n^3 - 1625*n^2 + 2120*n - 720)*a(n-1) + 2*(2*n-5)*(51*n^2 - 101*n + 36)*a(n-2) )/(2*n*(51*n^2 - 203*n + 188)), for n >= 2, with a(0) = 1, a(1) = 3.
%t A026627 a[n_]:= a[n]= If[n<2, 2*n+1, ((357*n^3 -1625*n^2 +2120*n -720)*a[n-1] +2*(2*n-5)*(51*n^2 -101*n +36)*a[n-2])/(2*n*(51*n^2-203*n+188))];
%t A026627 Table[a[n], {n,0,40}] (* _G. C. Greubel_, Jun 19 2024 *)
%o A026627 (Magma)
%o A026627 [n le 2 select 2*n-1 else ((357*n^3-2696*n^2+6441*n-4822)*Self(n-1) +2*(2*n-7)*(51*n^2-203*n+188)*Self(n-2))/(2*(n-1)*(51*n^2-305*n+442)): n in [1..41]]; // _G. C. Greubel_, Jun 19 2024
%o A026627 (SageMath)
%o A026627 @CachedFunction
%o A026627 def a(n): # a = A026627
%o A026627 if n<2: return 2*n+1
%o A026627 else: return ((357*n^3 -1625*n^2 +2120*n -720)*a(n-1) +2*(2*n-5)*(51*n^2 -101*n +36)*a(n-2))/(2*n*(51*n^2 -203*n +188))
%o A026627 [a(n) for n in range(41)] # _G. C. Greubel_, Jun 19 2024
%Y A026627 Cf. A026626, A026628, A026629, A026630, A026631, A026632, A026633.
%Y A026627 Cf. A026634, A026635, A026636, A026961, A026962, A026963, A026964.
%Y A026627 Cf. A026965.
%K A026627 nonn
%O A026627 0,2
%A A026627 _Clark Kimberling_