The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
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). 2
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
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
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 16:43 EDT 2024. Contains 372840 sequences. (Running on oeis4.)