|
%I #4 Mar 31 2012 12:35:46
%S 1,2,1,3,4,1,4,8,8,1,5,12,25,11,1,6,17,53,45,19,1,7,23,94,101,136,12,
%T 1,8,27,146,188,471,57,22,1,9,34,210,333,1229,214,190,22,1,10,40,288,
%U 479,2517,585,803,260,10,1,11,46,376,701,4859,1055,2997,1037,233,5,1,12,52
%N T(n,k)=number of increasing sequences of n integers x(1),...,x(n) with values in 1..k*n such that x(j) divides x(k) iff j divides k
%C Table starts
%C 1 2 3 4 5 6 7 8 9 10
%C 1 4 8 12 17 23 27 34 40
%C 1 8 25 53 94 146 210 288
%C 1 11 45 101 188 333 479
%C 1 19 136 471 1229 2517
%C 1 12 57 214 585
%C 1 22 190 803
%C 1 22 260
%C 1 10
%C 1
%H R. H. Hardin, <a href="/A180378/b180378.txt">Table of n, a(n) for n=1..512</a>
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Sep 01 2010
|
