We first introduce methods of finding the sum of the first n terms for an arithmetic sequence of higher order.

我们首先介绍了高阶等差数列前 n 项和的求解方法。

youdao

And you could then use a sequence of CTRL-N and CTRL-P (or the up - and down-arrows) to step through the menu and select the word you wanted.

然后，您可以分别使用CTRL - N和CTRL - P(或上下箭头)来在菜单的候选项上移动并选择您想要的单词。

youdao

The Fibonacci numbers are an integer sequence where for a given number, the Fibonacci value can be calculated using: F(n) = F(n-1) + F(n-2).

Fibonacci 数列是一种整数序列，可以使用以下算式计算各个 Fibonacci 值：F(n) = F(n-1) + F(n-2)。

youdao