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!)
A271551 a(0) = 0, a(n) = a(n-1)[n-1]a(n-1). 1

%I #13 Jan 11 2020 15:57:47

%S 0,1,2,4,256

%N a(0) = 0, a(n) = a(n-1)[n-1]a(n-1).

%C a[n]b is the square-bracket notation for n-th hyperoperation of a times b see A054871 for more info.

%e a(0) = 0;

%e a(1) = a(0)[0]a(0) = 1;

%e a(2) = a(1)[1]a(1) = 1+1 = 2;

%e a(3) = a(2)[2]a(2) = 2*2 = 4;

%e a(4) = a(3)[3]a(3) = 4^4 = 256;

%e a(5) = a(4)[4]a(4) = 256^^256 = 256^256^....^256 (256 times).

%Y Cf. A271552.

%K nonn,bref

%O 0,3

%A _Natan Arie Consigli_, Apr 09 2016

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 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)