Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037255
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A037255
%S A037255 0,1,4,12,31,70,141,259,442,711,1090,1606,2289,3172,4291,
%T A037255 5685,7396,9469,11952,14896,18355,22386,27049,32407,38526,
%U A037255 45475,53326,62154,72037,83056,95295,108841,123784,140217
%N A037255 For n weights, number of combinations when limited to two weights per 
               pan.
%C A037255 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.
%D A037255 Discovered by Tom Turrittin and Ed Pegg Jr.
%H A037255 Ed Pegg Jr., <a href="http://mathpuzzle.com/Solution.htm">COMMENTARY 
               ON WEEKLY PUZZLES</a>
%F A037255 (n^4 - 2*n^3 + 7*n^2 + 2*n) / 8.
%F A037255 Binomial transform of the sequence (0, 1, 2, 3, 3, 0, 0, 0, ....). - 
               Paul Barry (pbarry(AT)wit.ie), Sep 05 2005
%Y A037255 Cf. A038523.
%Y A037255 Sequence in context: A074252 A074210 A005289 this_sequence A027658 A001982 
               A129707
%Y A037255 Adjacent sequences: A037252 A037253 A037254 this_sequence A037256 A037257 
               A037258
%K A037255 easy,nonn
%O A037255 0,3
%A A037255 Ed Pegg Jr (ed(AT)mathpuzzle.com)

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research