cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A165426 #9 Jun 30 2021 12:06:39
%S A165426 1,8,8,64,4096,16777216,281474976710656,79228162514264337593543950336,
%T A165426 6277101735386680763835789423207666416102355444464034512896
%N A165426 a(1) = 1, a(2) = 8, a(n) = product of the previous terms for n >= 3.
%H A165426 G. C. Greubel, <a href="/A165426/b165426.txt">Table of n, a(n) for n = 1..13</a>
%F A165426 a(1) = 1, a(2) = 8, a(n) = Product_{i=1..n-1} a(i), n >= 3.
%F A165426 a(1) = 1, a(2) = 8, a(n) = A001018(2^(n-3)) = 8^(2^(n-3)), n >= 3.
%F A165426 a(1) = 1, a(2) = 8, a(3) = 8, a(n) = (a(n-1))^2, n >= 4.
%F A165426 a(n) = 8^A166444(n). [uncovered by sequencedb.net]. - _R. J. Mathar_, Jun 30 2021
%t A165426 a[1]:= 1; a[2]:= 8; a[n_]:= Product[a[j], {j,1,n-1}]; Table[a[n],{n,1, 12}] (* _G. C. Greubel_, Oct 19 2018 *)
%o A165426 (PARI) {a(n) = if(n==1, 1, if(n==2, 8, prod(j=1,n-1, a(j))))};
%o A165426 for(n=1,10, print1(a(n), ", ")) \\ _G. C. Greubel_, Oct 19 2018
%K A165426 nonn
%O A165426 1,2
%A A165426 _Jaroslav Krizek_, Sep 17 2009