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 A346374 #38 Jul 20 2021 03:10:55 %S A346374 1,3,15,85,511,3221,21339,149969,1133215,9343525,85089883,860979329, %T A346374 9665236335,119534610885,1613648163963,23564301925713,369437215969599, %U A346374 6180713141601765,109812899448776475,2063836219057694753,40894619124091715983,851891564231714448133 %N A346374 a(n) = f(n,n) where f(0,n) = f(n,0) = n! and f(m,n) = f(m-1,n) + f(m,n-1) + f(m-1,n-1). %C A346374 Main diagonal of square array of Delannoy-like numbers, but with the borders given by n! instead of 1. %C A346374 All terms are odd. %C A346374 a(n+1)/a(n) ~ n (conjectured). %F A346374 Conjecture: %F A346374 0 = (310000 - 87575*n^2 + 25110*n^3 - 2015*n^4)*a(n-6) %F A346374 + (-3082368 + 190872*n + 1063326*n^2 - 378291*n^3 + 37173*n^4)*a(n-5) %F A346374 + (8418604 - 1615685*n - 3834272*n^2 + 1836495*n^3 - 232486*n^4)*a(n-4) %F A346374 + (-4087868 + 3360702*n + 3358400*n^2 - 2858550*n^3 + 517914*n^4)*a(n-3) %F A346374 + (-3408770 - 992468*n + 1472981*n^2 + 176556*n^3 - 157931*n^4)*a(n-2) %F A346374 + (582108 + 205634*n - 541582*n^2 + 120633*n^3 + 12993*n^4)*a(n-1) %F A346374 + (-3362 - 20943*n + 37298*n^2 - 12993*n^3)*a(n). %p A346374 b:= proc(x, y) option remember; `if`(x=0, y!, %p A346374 b(x-1, y)+b(sort([x, y-1])[])+b(x-1, y-1)) %p A346374 end: %p A346374 a:= n-> b(n$2): %p A346374 seq(a(n), n=0..26); # _Alois P. Heinz_, Jul 14 2021 %t A346374 F[0, 0] = 1; F[m_, 0] := m!; F[0, n_] := n!; %t A346374 F[m_, n_] := F[m, n] = F[m - 1 , n ] + F[m , n - 1] + F[m - 1, n - 1]; %t A346374 Table[F[n, n], {n, 0, 100}] %Y A346374 Cf. A000142, A001850, A008288, A344576. %K A346374 nonn %O A346374 0,2 %A A346374 _José María Grau Ribas_, Jul 14 2021