login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
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
0, 1, 2, 4, 256
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,3
COMMENTS
a[n]b is the square-bracket notation for n-th hyperoperation of a times b see
A054871
for more info.
LINKS
Table of n, a(n) for n=0..4.
EXAMPLE
a(0) = 0;
a(1) = a(0)[0]a(0) = 1;
a(2) = a(1)[1]a(1) = 1+1 = 2;
a(3) = a(2)[2]a(2) = 2*2 = 4;
a(4) = a(3)[3]a(3) = 4^4 = 256;
a(5) = a(4)[4]a(4) = 256^^256 = 256^256^....^256 (256 times).
CROSSREFS
Cf.
A271552
.
Sequence in context:
A018770
A260755
A173566
*
A058990
A343255
A262413
Adjacent sequences:
A271548
A271549
A271550
*
A271552
A271553
A271554
KEYWORD
nonn
,
bref
AUTHOR
Natan Arie Consigli
, Apr 09 2016
STATUS
approved
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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)