Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #36 Sep 09 2016 14:41:00
%S 0,1,6,543,3323092,3617739047205,1300400946990709367556,
%T 243871405119475828112307128378587,
%U 34439765790040491446227712415465752285191304328,4981962825852754222934017283812757768035873070500785373442371593
%N Number of paths starting at {n}^n to a border position where one component equals 0 using steps that decrement one component by 1.
%F a(n) = A210472(n,n).
%Y Main diagonal of A210472.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Sep 09 2016