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.

A264933 a(0)=0; a(1)=1; a(2)=2; a(n) = a(n-1)^a(n-2)^a(n-3).

This page as a plain text file.
%I A264933 #10 Sep 08 2022 08:46:14
%S A264933 0,1,2,2,4,256,340282366920938463463374607431768211456
%N A264933 a(0)=0; a(1)=1; a(2)=2; a(n) = a(n-1)^a(n-2)^a(n-3).
%e A264933 a(3) = a(2)^a(1)^a(0) = 2;
%e A264933 a(4) = a(3)^a(2)^a(1) = 2^2^1 = 4;
%e A264933 a(5) = a(4)^a(3)^a(2) = 4^2^2 = 256;
%e A264933 a(6) = a(5)^a(4)^a(3) = 256^4^2 = 340282366920938463463374607431768211456.
%t A264933 RecurrenceTable[{a[0]==0, a[1]==1, a[2]==2, a[n]==a[n-1]^a[n-2]^a[n-3]}, a, {n, 6}]
%o A264933 (Magma) I:=[0, 1, 2]; [n le 2 select I[n] else Self(n-1)^Self(n-2)^Self(n-3): n in [0..6]];
%o A264933 (PARI) a(n) = if(n<3, n, a(n-1)^a(n-2)^a(n-3));
%Y A264933 Cf. A051285.
%K A264933 nonn
%O A264933 0,3
%A A264933 _Natan Arie Consigli_, Dec 17 2015