A212539 Number of nondecreasing sequences of 6 1..n integers with every element dividing the sequence sum.
1, 4, 8, 15, 21, 40, 44, 64, 76, 103, 104, 148, 149, 165, 197, 229, 230, 271, 272, 343, 362, 367, 368, 449, 457, 462, 478, 521, 522, 639, 640, 677, 685, 688, 707, 800, 801, 804, 812, 937, 938, 1011, 1012, 1026, 1094, 1097, 1098, 1204, 1208, 1241, 1246, 1262, 1263
Offset: 1
Keywords
Examples
Some solutions for n=8 ..1....2....1....1....2....1....1....5....1....2....1....1....1....6....2....2 ..1....2....1....1....2....1....1....5....2....4....1....1....1....6....3....2 ..2....2....1....2....4....1....2....5....4....4....1....4....1....6....3....3 ..2....6....1....2....4....1....2....5....4....4....2....6....1....6....4....3 ..3....6....4....2....4....1....2....5....4....4....2....6....2....6....6....6 ..3....6....8....4....8....5....8....5....5....6....7....6....2....6....6....8
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Comments