cp's OEIS Frontend

A258967 a(1)=1, a(2)=2, a(3)=3, a(n) = ceiling(sqrt(a(n-1)*a(n-2)*a(n-3))), n>3.

%I A258967 #23 Sep 08 2022 08:46:13
%S A258967 1,2,3,3,5,7,11,20,40,94,275,1017,5128,37871,444415,9290130,395420005,
%T A258967 40404949540,12183091294648,13951642918891149,82872169787001239679,
%U A258967 3753148776564192982863648,2083123034674803589767277778237,25454214863632278822694894280883452911
%N A258967 a(1)=1, a(2)=2, a(3)=3, a(n) = ceiling(sqrt(a(n-1)*a(n-2)*a(n-3))), n>3.
%H A258967 Harvey P. Dale, <a href="/A258967/b258967.txt">Table of n, a(n) for n = 1..39</a>
%F A258967 a(n) is approximately k^(c^n), where c is the real root of x^3 - (x^2 + x + 1)/2 = 0 equal to (1 + (64 - 3*sqrt(417))^(1/3) + (64 + 3*sqrt(417))^(1/3))/6, and k is approximately 1.7450496...
%e A258967 a(4) = ceiling(sqrt(1*2*3)) = 3;
%e A258967 a(5) = ceiling(sqrt(2*3*3)) = 5;
%e A258967 a(6) = ceiling(sqrt(3*3*5)) = 7.
%t A258967 RecurrenceTable[{a[n] == Ceiling[Sqrt[a[n - 1] a[n - 2] a[n - 3]]], a[1] == 1, a[2] == 2, a[3] == 3}, a, {n, 1, 23}] (* _Michael De Vlieger_, Jul 02 2015 *)
%t A258967 a[1] = 1; a[2] = 2; a[3] = 3; a[n_] := a[n] = Ceiling[ Sqrt[ a[n - 1]*a[n - 2]*a[n - 3]]]; Array[a, 23] (* _Robert G. Wilson v_, Aug 12 2015 *)
%t A258967 nxt[{a_,b_,c_}]:={b,c,Ceiling[Sqrt[a*b*c]]}; NestList[nxt,{1,2,3},30][[All,1]] (* _Harvey P. Dale_, Sep 09 2021 *)
%o A258967 (Magma) I:=[1, 2, 3]; [n le 3 select I[n] else Ceiling(Sqrt(Self(n-1)*Self(n-2)*Self(n-3))): n in [1..23]];
%o A258967 (PARI) first(m)={my(v=vector(m));v[1]=1;v[2]=2;v[3]=3;for(i=4,m,v[i]=ceil(sqrt(v[i-1]*v[i-2]*v[i-3])));v;} \\ _Anders Hellström_, Aug 20 2015
%Y A258967 Cf. A258875, A254400.
%K A258967 nonn
%O A258967 1,2
%A A258967 _Morris Neene_, Jun 15 2015
%E A258967 Corrected and extended by _Harvey P. Dale_, Sep 09 2021