login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A231151 Least integer k such that n+1 + ... + n+k > 1 + ... + n. 3
2, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 7, 7, 8, 8, 9, 9, 9, 10, 10, 11, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 22, 22, 23, 23, 23, 24, 24, 25, 25, 26, 26, 26, 27, 27, 28, 28, 28, 29, 29, 30, 30 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
a(n) is the least k such that 2*p(n) < p(n+k), where p(n) is the n-th partial sum of the sequence c(n) = n.
LINKS
FORMULA
a(n) = 1 + Floor[(-2 n - 1 + sqrt(8*n^2 + 8*n + 1)/2)].
EXAMPLE
3 <= 1 + 2 < 3 + 4, so a(2) = 2
4 <= 1 + 2 + 3 < 4 + 5, so a(3) = 3.
11+12+13+14 <= 55 < 11+12+13+14+15, so a(10) = 5.
MATHEMATICA
1 + Table[test = n (1 + n); NestWhile[# + 1 &, n + 1, test >= -(n - #1) (1 + n + #1) &] - n - 1, {n, 2, 120}] (* Peter J. C. Moses, Nov 07 2013 *)
t = 1 + Table[Floor[(-2 n - 1 + Sqrt[8 n^2 + 8 n + 1])/2], {n, 2, 120}]
CROSSREFS
Sequence in context: A057354 A172476 A172267 * A097508 A244225 A109964
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Nov 09 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)