login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165421 a(1) = 1, a(2) = 3, a(n) = product of the previous terms for n >= 3. 5

%I #19 Jan 31 2022 14:43:30

%S 1,3,3,9,81,6561,43046721,1853020188851841,

%T 3433683820292512484657849089281,

%U 11790184577738583171520872861412518665678211592275841109096961

%N a(1) = 1, a(2) = 3, a(n) = product of the previous terms for n >= 3.

%C Essentially a duplicate of A011764. - _N. J. A. Sloane_, Oct 06 2009

%H Vincenzo Librandi, <a href="/A165421/b165421.txt">Table of n, a(n) for n = 1..14</a>

%F a(1) = 1, a(2) = 3, a(n) = Product_{i=1..n-1} a(i), n >= 3.

%F a(1) = 1, a(2) = 3, a(n) = A000244(2^(n-3)) = A011764(n-3) = 3^(2^(n-3)), n >= 3.

%F a(1) = 1, a(2) = 3, a(3) = 3, a(n) = (a(n-1))^2, n >= 4.

%t a[1]:= 1; a[2]:= 3; a[n_]:= Product[a[j], {j,1,n-1}]; Table[a[n], {n, 1, 12}] (* _G. C. Greubel_, Oct 19 2018 *)

%t nxt[{prd_,a_}]:=Module[{c=prd*a},{c,prd*a}]; Join[{1,3},Rest[ NestList[ nxt,{1,3},10][[All,1]]]] (* _Harvey P. Dale_, Jan 31 2022 *)

%o (PARI) {a(n) = if(n==1, 1, if(n==2, 3, prod(j=1,n-1, a(j))))};

%o for(n=1,10, print1(a(n), ", ")) \\ _G. C. Greubel_, Oct 19 2018

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Sep 17 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)