|
Search: id:A135061
|
|
|
| A135061 |
|
a(n) = minimum (floor(n^3/m) + m) for any integer m>=1. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) a(n) = {local( minsum=0, cursum =0, minm=0, lastminsum=0); minsum = n^3 + 1; lastminsum= n^3 + 1; minm =1; for(m=1, n^3, cursum = floor(n^3/m + m); lastminsum = minsum; if(cursum < minsum, minsum = cursum); if(cursum < lastminsum, minm=m); ); print1("minm="minm" "); print1("minsum="minsum" "); }
|
|
CROSSREFS
|
Cf. A135072.
Sequence in context: A027913 A081204 A106672 this_sequence A069156 A060744 A066915
Adjacent sequences: A135058 A135059 A135060 this_sequence A135062 A135063 A135064
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander R. Povolotsky (pevnev(AT)juno.com), Feb 11 2008, Feb 15 2008
|
|
|
Search completed in 0.002 seconds
|
