|
Search: id:A138554
|
|
|
| A138554 |
|
Minimal value of sum k_i when sum (k_i)^2 = n. |
|
+0
2
|
|
| 0, 1, 2, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 5, 6, 7, 4, 5, 6, 7, 6, 7, 8, 9, 8, 5, 6, 7, 8, 7, 8, 9, 8, 9, 8, 9, 6, 7, 8, 9, 8, 9, 10, 11, 10, 9, 10, 11, 12, 7, 8, 9, 10, 9, 10, 11, 12, 11, 10, 11, 12, 11, 12, 13, 8, 9, 10, 11, 10, 11, 12, 13, 12, 11, 12, 13, 14, 13, 14, 15, 12, 9, 10, 11, 12, 11
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
32 = 4^2 + 4^2, and 4+4 = 8. Using 5, the best we can do is 32 = 5^2 + 2^2 + 1^2 + 1^2 + 1^2, and 5+2+1+1+1 = 10, so a(32) = 8.
|
|
PROGRAM
|
(PARI) sslist(n) = {local(r, i, v, t); r=vector(n+1, k, 0); for(k=1, n, v=k; i=1; while(i^2<=k, t=r[k-i^2+1]+i; if(t<v, v=t); i++); r[k+1]=v); r}
|
|
CROSSREFS
|
Cf A063772, A138555, A001156.
Sequence in context: A125929 A071933 A064672 this_sequence A063772 A064289 A078759
Adjacent sequences: A138551 A138552 A138553 this_sequence A138555 A138556 A138557
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Mar 24 2008
|
|
|
Search completed in 0.002 seconds
|
