This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214725 Smallest number expressible as a sum of 9 cubes (including 0) in n ways. 1
 0, 8, 35, 72, 133, 189, 216, 224, 280, 376, 411, 496, 533, 472, 568, 624, 712, 720, 784, 783, 908, 946, 992, 945, 1062, 1072, 1081, 1107, 1153, 1161, 1224, 1288, 1376, 1377, 1449, 1459, 1547, 1496, 1504, 1593, 1592, 1712, 1719, 1648, 1783, 1800, 1837, 1864 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 EXAMPLE a(1) = 0: [0,0,0,0,0,0,0,0,0]. a(2) = 8: [0,0,0,0,0,0,0,0,2], [0,1,1,1,1,1,1,1,1]. a(3) = 35: [0,0,0,0,0,0,0,2,3], [0,0,1,1,1,2,2,2,2], [1,1,1,1,1,1,1,1,3]. a(7) = 216: [0,0,0,0,0,0,0,0,6], [0,1,1,1,2,2,2,4,5], [0,0,1,1,2,3,3,3,5], [1,2,2,3,3,3,3,3,4], [0,0,0,2,2,2,4,4,4], [0,3,3,3,3,3,3,3,3], [0,0,0,0,0,0,3,4,5]. MAPLE b:= proc(n, i, t) option remember;       `if`(n=0, 1, `if`(i<1 or t<1, 0, b(n, i-1, t)+       `if`(i^3>n, 0, b(n-i^3, i, t-1))))     end: a:= proc(n) local k;       for k from 0 while b(k, isqrt(k), 9)<>n do od; k     end: seq (a(n), n=1..20);  # Alois P. Heinz, Jul 26 2012 CROSSREFS Sequence in context: A275360 A281147 A217187 * A136016 A257454 A305672 Adjacent sequences:  A214722 A214723 A214724 * A214726 A214727 A214728 KEYWORD nonn AUTHOR Claudio Meller, Jul 26 2012 EXTENSIONS More terms from Alois P. Heinz, Jul 26 2012 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 17 19:24 EDT 2019. Contains 328127 sequences. (Running on oeis4.)