A005831 -id:A005831 - cp's OEIS frontend

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

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

nonn

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

Cf. A005831.

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

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

A253832 a(n) = a(n-1) * (1 + a(n-2)/a(n-4)), a(0) = a(1) = a(2) = a(3) = 1.

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 12, 60, 420, 6720, 241920, 27336960, 15773425920, 64182070068480, 4184799332605032960, 9825130460280752853949440, 2606675287692747620296839987164160, 399035505430293222012069797891526139192304640

Offset: 0

Michael Somos, Jan 17 2015

nonn

This sequence is similar to A005831 except for the division.

Seiichi Manyama, Table of n, a(n) for n = 0..27

Cf. A005831, A253853.

I:=[1,1,1,1]; [n le 4 select I[n] else Self(n-1)*(1 + Self(n-2)/Self(n-4)): n in [1..20]]; // G. C. Greubel, Aug 03 2018

RecurrenceTable[{a[n]==a[n-1]*(1 + a[n-2]/a[n-4]), a[0]==1, a[1]==1, a[2]==1,a[3]==1},a,{n,0,20}] (* Vaclav Kotesovec, Jan 18 2015 *)
nxt[{a_,b_,c_,d_}]:={b,c,d,d(1+c/a)}; NestList[nxt,{1,1,1,1},20][[All,1]] (* Harvey P. Dale, Dec 27 2022 *)

{a(n) = if( n<4, n>=0, a(n-1) * (1 + a(n-2) / a(n-4)))};

0 = a(n)*(a(n+3) - a(n+4)) + a(n+2)*a(n+3) for all n >= 0.
a(n+1) = a(n) * A253853(n) for all n >= 0.
a(n) ~ b * f^(d^n), where b = 0.103038949751108..., f = c^(1/(d-1)) = 2.4130332882212... and d = ((27-3*sqrt(69))/2)^(1/3) / 3 + ((9+sqrt(69))/2)^(1/3) / 3^(2/3) = 1.324717957244746... is the root of the equation d^3 = d + 1. For the constant c = 1.33114442478885300080049... see A253853. - Vaclav Kotesovec, Jan 18 2015

cp's OEIS Frontend

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).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula