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.

A211368 Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) ( n + 2(i-1) )!

This page as a plain text file.
%I A211368 #9 Jul 13 2012 17:35:42
%S A211368 1,2,7,6,26,127,24,126,746,5167,120,744,5166,41066,368047,720,5160,
%T A211368 41064,368046,3669866,40284847,5040,41040,368040,3669864,40284846,
%U A211368 482671466,6267305647,40320,367920,3669840,40284840,482671464,6267305646
%N A211368 Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) ( n + 2(i-1) )!
%C A211368 Index numbers (compare A055089) of rows of adjacent transpositions.
%H A211368 Tilman Piesk, <a href="/A211368/b211368.txt">Table of n, a(n) for n = 1..2016</a>
%H A211368 Tilman Piesk, <a href="http://en.wikiversity.org/wiki/Inversion_%28discrete_mathematics%29#arrays2">Arrays of permutations</a> (Wikiversity)
%e A211368 T(3,2) = Sum( 1 <= i <= 3 ) [ ( 2 + 2(i-1) )! ]
%e A211368 = (2+0)! + (2+2)! + (2+4)!
%e A211368 = 2 + 24 + 720
%e A211368 = 746
%Y A211368 Cf. A055089.
%K A211368 nonn,tabl
%O A211368 1,2
%A A211368 _Tilman Piesk_, Jul 07 2012