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.

A260419 Square array T(n,m) read by antidiagonals, T(n,m) is the number of (m,n)-parking functions.

This page as a plain text file.
%I A260419 #21 Nov 30 2015 10:35:42
%S A260419 1,1,1,1,3,1,1,3,4,1,1,5,16,11,1,1,5,16,27,16,1,1,7,25,125,81,42,1,1,
%T A260419 7,49,125,256,378,64,1,1,9,49,243,1296,1184,729,163,1,1,9,64,343,1296,
%U A260419 3125,4096,2187,256,1,1,11,100,729,2401,16807,15625,27213,9529,638,1
%N A260419 Square array T(n,m) read by antidiagonals, T(n,m) is the number of (m,n)-parking functions.
%C A260419 T(n,2) appears to be A027306(n).
%H A260419 Alois P. Heinz, <a href="/A260419/b260419.txt">Antidiagonals n = 1..141, flattened</a>
%H A260419 Jean-Christophe Aval, François Bergeron, <a href="http://arxiv.org/abs/1503.03991">Interlaced rectangular parking functions</a>, arXiv:1503.03991 [math.CO], 2015.
%F A260419 T(n,m) = m^(n-1), if m and n are coprime (see Lemma in Aval & Bergeron link).
%e A260419 Table starts (see Table 1 in Aval & Bergeron link):
%e A260419 n/m  1   2    3    4     5
%e A260419 ------------------------------
%e A260419 1   |1,  1,   1,   1,    1, ...
%e A260419 2   |1,  3,   3,   5,    5, ...
%e A260419 3   |1,  4,  16,  16,   25, ...
%e A260419 4   |1, 11,  27, 125,  125, ...
%e A260419 5   |1, 16,  81, 256, 1296, ...
%e A260419 6   |...
%Y A260419 Cf. A071201.
%K A260419 nonn,tabl
%O A260419 1,5
%A A260419 _Michel Marcus_, Jul 25 2015
%E A260419 More terms from _Alois P. Heinz_, Nov 30 2015