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!)
A067652 a(n) = H_n(2,3) = H_(n-1)(2,4) where H_n is the n-th hyperoperator. 2

%I #31 Mar 27 2020 10:14:46

%S 4,5,6,8,16,65536

%N a(n) = H_n(2,3) = H_(n-1)(2,4) where H_n is the n-th hyperoperator.

%C Originally named "2 plus 3, twice 3, 2 to the power of 3, etc."

%C For hyperoperator definitions and links, see A054871.

%C For nonnegative n, H_(n)(2,3) = H_(n-1)(2,H_(n-1)(2,2)) = H_(n-1)(2,4) or in the clearer square bracket notation: 2[n]3 = 2[n-1]2[n-1]2 = 2[n-1]4. - _Natan Arie Consigli_, Dec 07 2015

%e H_0(2,3) = 3+1 = 4;

%e H_1(2,3) = 2+3 = 5;

%e H_2(2,3) = 2*3 = 6;

%e H_3(2,3) = 2^3 = 2*2*2 = 2*4 = H_2(2,4) = 8;

%e H_4(2,3) = 2^^3 = 2^2^2 = 2^4 = H_3(2,4) = 16;

%e H_5(2,3) = 2^^^3 = 2^^2^^2 = 2^^4 = H_4(2,4) = 2^2^2^2 = 2^16 = 65536;

%e H_6(2,3) = 2^^^^3 = 2^^^2^^^2 = 2^^^4 = H_5(2,4) = 2^^2^^2^^2 = 2^^65536 = 2^2^...^2^2, with 65536 2's.

%o (Haskell) f a 0 = 2 + a / f 0 1 = 0 / f 0 n = 1 / f a n = f (f (a-1) n) (n-1)

%Y Cf. A054871.

%K nonn,bref

%O 0,1

%A Ashley Yakeley (ashley(AT)yakeley.org), Feb 03 2002

%E Hyperoperator notation, new initial term, and examples by _Danny Rorabaugh_, Oct 14 2015

%E Sequence merged with H_(n)(2,4) by _Natan Arie Consigli_, Dec 07 2015

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 19 02:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)