|
Search: id:A037255
|
|
|
| A037255 |
|
For n weights, number of combinations when limited to two weights per pan. |
|
+0
2
|
|
| 0, 1, 4, 12, 31, 70, 141, 259, 442, 711, 1090, 1606, 2289, 3172, 4291, 5685, 7396, 9469, 11952, 14896, 18355, 22386, 27049, 32407, 38526, 45475, 53326, 62154, 72037, 83056, 95295, 108841, 123784, 140217
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
For 4 weights, 1, 3, 8, 23 works for values up to 28. For 5 weights, 10, 12, 13, 17, 51 works up to 56. The lowest set of n weights with f(n) distinct values is still unknown at this time.
|
|
REFERENCES
|
Discovered by Tom Turrittin and Ed Pegg Jr.
|
|
LINKS
|
Ed Pegg Jr., COMMENTARY ON WEEKLY PUZZLES
|
|
FORMULA
|
(n^4 - 2*n^3 + 7*n^2 + 2*n) / 8.
Binomial transform of the sequence (0, 1, 2, 3, 3, 0, 0, 0, ....). - Paul Barry (pbarry(AT)wit.ie), Sep 05 2005
|
|
CROSSREFS
|
Cf. A038523.
Sequence in context: A074252 A074210 A005289 this_sequence A027658 A001982 A129707
Adjacent sequences: A037252 A037253 A037254 this_sequence A037256 A037257 A037258
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Ed Pegg Jr (ed(AT)mathpuzzle.com)
|
|
|
Search completed in 0.002 seconds
|
