login

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”).

A180378
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
5
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, 1, 8, 27, 146, 188, 471, 57, 22, 1, 9, 34, 210, 333, 1229, 214, 190, 22, 1, 10, 40, 288, 479, 2517, 585, 803, 260, 10, 1, 11, 46, 376, 701, 4859, 1055, 2997, 1037, 233, 5, 1, 12, 52
OFFSET
1,2
COMMENTS
Table starts
1 2 3 4 5 6 7 8 9 10
1 4 8 12 17 23 27 34 40
1 8 25 53 94 146 210 288
1 11 45 101 188 333 479
1 19 136 471 1229 2517
1 12 57 214 585
1 22 190 803
1 22 260
1 10
1
LINKS
CROSSREFS
Sequence in context: A188236 A181851 A210231 * A208341 A201634 A210211
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Sep 01 2010
STATUS
approved