login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A052146
a(n) = floor((sqrt(1+8*n)-3)/2).
5
0, 0, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11
OFFSET
1,6
REFERENCES
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 7.2(d).
MATHEMATICA
Floor[(Sqrt[1 + 8 Range[100]] - 3)/2] (* Wesley Ivan Hurt, Oct 02 2021 *)
CROSSREFS
Sequence in context: A104147 A227568 A232746 * A097882 A108955 A108956
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 23 2000
STATUS
approved