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 A344914 #5 Feb 13 2022 18:05:44 %S A344914 1,1,2,6,8,24,8,120,16,720,48,64,5040,192,64,40320,960,128,362880, %T A344914 5760,384,512,3628800,40320,1536,512,39916800,322560,7680,1024, %U A344914 479001600,2903040,46080,3072,4096,6227020800,29030400,322560,12288,4096 %N A344914 T(n, k) = 2^(3*k)*(n - 3*k)!, for n >= 0 and 0 <= k <= floor(n/3). Triangle read by rows. %e A344914 [ 0] 1; %e A344914 [ 1] 1; %e A344914 [ 2] 2; %e A344914 [ 3] 6, 8; %e A344914 [ 4] 24, 8; %e A344914 [ 5] 120, 16; %e A344914 [ 6] 720, 48, 64; %e A344914 [ 7] 5040, 192, 64; %e A344914 [ 8] 40320, 960, 128; %e A344914 [ 9] 362880, 5760, 384, 512; %e A344914 [10] 3628800, 40320, 1536, 512; %e A344914 [11] 39916800, 322560, 7680, 1024; %e A344914 [12] 479001600, 2903040, 46080, 3072, 4096; %p A344914 T := (n, k) -> 2^(3*k)*(n-3*k)!: seq(seq(T(n,k), k = 0..n/3), n = 0..13); %t A344914 Table[2^(3k) (n-3k)!,{n,0,20},{k,0,Floor[n/3]}]//Flatten (* _Harvey P. Dale_, Feb 13 2022 *) %Y A344914 Cf. A000142, A138230. %K A344914 nonn,tabf %O A344914 0,3 %A A344914 _Peter Luschny_, Jun 06 2021