A007807 A variation on Euclid: a(n)=g(n)-1, where g(0)=0, g(1)=1, g(n+1)=g(n)(g(n-1)+1).

0, 0, 1, 3, 11, 59, 779, 47579, 37159979, 1768109008379, 65702897157329640779, 116169884340604934905464739377179, 7632697963609645128663145969343357330533515068777579

Offset: 1

Author

mays(AT)math.wvu.edu (Mike Mays)

Keywords

• nonn

Links

• M. E. Mays, Iterating the division algorithm, Fib. Quart., 25 (1987), 204-213.

Crossrefs

Cf. A005831.

Programs

PARI

{a(n) = if( n<4, n==3, -1 + (1 + a(n-1)) * (2 + a(n-2)))}; /* Michael Somos, Jan 17 2015 */

Formula

a(n) = A005831(n) - 1 for all n>0. - Michael Somos, Jan 17 2015