login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093001 Least k such that Sum_{r=n+1..k} r is greater than or equal to the sum of the first n positive integers (i.e., the n-th triangular number, A000217(n)). Or, least k such that (sum of first n positive integers) <= (sum of numbers from n+1 up to k). 1
2, 3, 5, 6, 8, 9, 11, 12, 13, 15, 16, 18, 19, 20, 22, 23, 25, 26, 28, 29, 30, 32, 33, 35, 36, 37, 39, 40, 42, 43, 45, 46, 47, 49, 50, 52, 53, 54, 56, 57, 59, 60, 62, 63, 64, 66, 67, 69, 70, 71, 73, 74, 76, 77, 78, 80, 81, 83, 84, 86, 87, 88, 90, 91, 93, 94, 95, 97, 98, 100, 101 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..71.

FORMULA

a(n) = ceiling((-1 + sqrt(8n^2 + 8n + 1))/2). - Joshua Zucker, May 08 2006

EXAMPLE

a(6)= 9, 7+8+9 > 1+2+3+4+5+6, but 7+8 < 1+2+3+4+5+6.

MATHEMATICA

Table[Ceiling[(-1 + Sqrt[8 n^2 + 8 n + 1])/2], {n, 0, 80}] (* Vincenzo Librandi, Jun 23 2015 *)

PROG

(PARI) a(n) = {my(k=1); while (sum(j=n+1, k, j) < n*(n+1)/2, k++); k; } \\ Michel Marcus, Jul 23 2015

(MAGMA) [Ceiling((-1 + Sqrt(8*n^2 + 8*n + 1))/2): n in [1..80]]; // Vincenzo Librandi, Jul 23 2015

CROSSREFS

Cf. A093000.

Sequence in context: A161188 A184117 A184624 * A226721 A224996 A246046

Adjacent sequences:  A092998 A092999 A093000 * A093002 A093003 A093004

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy, Mar 29 2004

EXTENSIONS

More terms from Joshua Zucker, May 08 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 14:11 EST 2020. Contains 338768 sequences. (Running on oeis4.)