Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135072
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135072 Minimal values of m associated with A135061. +0
2
1, 2, 4, 6, 9, 13, 15, 19, 23, 28 (list; graph; listen)
OFFSET

1,2

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. A135061.

Sequence in context: A005690 A005779 A098387 this_sequence A038709 A049981 A025705

Adjacent sequences: A135069 A135070 A135071 this_sequence A135073 A135074 A135075

KEYWORD

nonn

AUTHOR

Alexander R. Povolotsky (pevnev(AT)juno.com), Feb 11 2008, Feb 15 2008

page 1

Search completed in 0.002 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 November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research