login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; table; graph; refs; listen; history; text; internal format)
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

R. H. Hardin, Table of n, a(n) for n=1..370

CROSSREFS

Sequence in context: A201634 A210211 A247358 * A133807 A093375 A103283

Adjacent sequences:  A180380 A180381 A180382 * A180384 A180385 A180386

KEYWORD

nonn,tabl

AUTHOR

R. H. Hardin Sep 01 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 02:07 EST 2016. Contains 278902 sequences.