Floyd's Triangle

Floyd's Triangle

Floyd’s triangle is a right-angled triangular array of natural numbers.

Floyd's triangle是自然数的直角三角形数组

It is defined by filling the rows of the triangle with consecutive numbers, starting with a 1 in the top left corner.

它是通过用连续的数字填充三角形的行来定义的，从左上角的1开始。

The numbers along the left edge of the triangle are the lazy caterer’s sequence and the numbers along the right edge are the triangular numbers.

The nth row sums to n(n^n + 1)/2, the constant of an n × n magic square.

Example: Floyd’s Triangle with a depth of 5.

示例：深度为5的弗洛伊德三角

var tempStr = "", prevNumber=1, i, j, depth = 10;
for (i = 0; i < depth;i++) {
    tempStr = "";
    j=0;
  	while (j <= i) {
        tempStr = tempStr + "    " + prevNumber;
        j++;
        prevNumber++;
	}
	console.log(tempStr);
}

Output

1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31 32 33 34 35 36
37 38 39 40 41 42 43 44 45
46 47 48 49 50 51 52 53 54 55