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.
%I A299399 #23 Jun 09 2022 18:31:22 %S A299399 1,1,2,3,6,36,1296,839808,235092492288,9211413321697223245824, %T A299399 2356948205087252000835395074931259831484416, %U A299399 4286423488783965214900384842824017360544199884413056912194095171350270745233063936 %N A299399 a(n) = a(n-1)*a(n-2)*a(n-3)*a(n-4); a(0..3) = (1, 1, 2, 3). %C A299399 A variant of A000336 which uses initial values (1,2,3,4). %C A299399 A multiplicative variant of the tetranacci sequences A000078, A001631 and other variants. %H A299399 Seiichi Manyama, <a href="/A299399/b299399.txt">Table of n, a(n) for n = 0..14</a> %F A299399 a(n) = a(n-1)^2 / a(n-5) for n > 4. %F A299399 a(n) = 2^A001631(n)*3^A000078(n). %t A299399 nxt[{a_,b_,c_,d_}]:={b,c,d,a b c d}; NestList[nxt,{1,1,2,3},13][[All,1]] (* _Harvey P. Dale_, Jun 09 2022 *) %o A299399 (PARI) A299399(n,a=[1,1,2,3,6])={for(n=5,n,a[n%#a+1]=a[(n-1)%#a+1]^2\a[n%#a+1]);a[n%#a+1]} %Y A299399 Cf. A000336 (variant starting 1,2,3,4). %Y A299399 Cf. A000301 (order 2 variant), A000308 (order 3 variant). %Y A299399 Subsequence of A003586 (3-smooth numbers). %Y A299399 Cf. A000078, A001631 (additive variants). %K A299399 nonn %O A299399 0,3 %A A299399 _M. F. Hasler_, Apr 22 2018