%I A066387
%S A066387 1,1,2,1,0,6,1,12,0,24,1,0,0,0,120,1,120,360,0,0,720,1,0,0,0,0,0,5040,
%T A066387 1,1680,0,20160,0,0,0,40320,1,0,60480,0,0,0,0,0,362880,1,30240,0,0,
%U A066387 1814400,0,0,0,0,3628800,1,0,0,0,0,0,0,0,0,0,39916800
%N A066387 Triangle T(n,m) (1<=m<=n) giving number of maps f:N -> N such that f^m(X)=X+n 
               for all natural numbers X.
%D A066387 A. Heinis, R. Jeurissen and L. Kamstra, Problem 18 and solution, Nieuw 
               Arch. Wisk. 5/2 (2001) 380.
%F A066387 T(n, m) = n!/(n/m)! if m|n, T(n, m) = 0 otherwise.
%Y A066387 Sequence in context: A119275 A129462 A122930 this_sequence A011312 A147720 
               A127631
%Y A066387 Adjacent sequences: A066384 A066385 A066386 this_sequence A066388 A066389 
               A066390
%K A066387 easy,nonn,tabl,nice
%O A066387 1,3
%A A066387 Floor van Lamoen (fvlamoen(AT)hotmail.com), Dec 23 2001