A302349 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A302349

a(n) = F_n(n,n), where F is the Clenshaw-Olver hyper-operation hierarchy.

1, 2, 4, 9, 13407807929942597099574024998205846127479365820592393377723561443721764030073546976801874298166903427690031858186486050853753882811946569946433649006084096

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

a(5) is too big to include.

The Clenshaw Olver hyper-operation is a recursive function defined as follows:

F_0(a,b) = b+1

F_n(a,0) = 0

F_n+1(a,b+1) = F_n(a, F_n+1(a, b)), for every nonnegative b and n.

LINKS

Table of n, a(n) for n=0..4.

C. W. Clenshaw and F. W. J. Olver, Beyond floating point, Journal of the ACM. 31 (2) April 1984, pp. 319-328.

FORMULA

F_1(a,b) = a+b;

F_2(a,b) = ab;

F_3(a,b) = a^b;

F_4(a,b) = a[4](b-1).

a[n]b is the square bracket notation for hyper-operation. See A054871 for details.

EXAMPLE

F_0(0,0) = 0+1 = 1;

F_1(1,1) = 1+1 = 2;

F_2(2,2) = 2*2 = 4;

F_3(a,b) = 3^3 = 9;

F_4(a,b) = 4[4](4-1) = 4^4^4 = ...

CROSSREFS

Cf. A054871, A189896 (same instance using traditional hyper-operation hierarchy).

Sequence in context: A128942 A364637 A328837 * A135445 A098556 A159585

Adjacent sequences: A302346 A302347 A302348 * A302350 A302351 A302352

KEYWORD

nonn

AUTHOR

Natan Arie Consigli, Apr 05 2018

STATUS

approved