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

A180383
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) if j divides k
5
1, 2, 1, 3, 4, 1, 4, 8, 11, 1, 5, 12, 32, 15, 1, 6, 17, 69, 66, 48, 1, 7, 23, 114, 143, 310, 48, 1, 8, 27, 179, 268, 1051, 228, 113, 1, 9, 34, 252, 473, 2585, 1041, 1286, 89, 1, 10, 40, 347, 671, 5297, 2453, 6722, 1857, 78, 1, 11, 46, 441, 974, 9492, 5235, 23133, 8485, 1679, 42
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 11 32 69 114 179 252 347
1 15 66 143 268 473 671
1 48 310 1051 2585 5297
1 48 228 1041 2453
1 113 1286 6722
1 89 1857
1 78
1
LINKS
CROSSREFS
Sequence in context: A283054 A247358 A297224 * A374896 A133807 A325001
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Sep 01 2010
STATUS
approved