AHN

Arcioko Hash Notation [NOT1]

Basic rule 1:

· #a = 2^a

Basic rule 2:

· #^(1)a = #a

Basic rule 3:

· #^(b)a = #^(b-1) #^(b-1)… (a times) … #^(b-1)) #^(b-1))a

Rule 1:

· #^( b₁, b₂, … , b_k-1, b_k, 1) = #^( b₁, b₂, … , b_k-1, b_k)

Rule 2:

· #^(b)_na= #^(a, a, … (b number of a’s) … ,a, a), #^(b)₁n = #^(b)a

Rule 3:

· Let A = #^( b₁, b₂, … , b_k-1, b_k)_n a

· Let B = #^(b₁, b₂, … , b_k-1, b_k - 1)_n a

· A = #^(b₁, B, B, … (k-2 number of B’s) ... B, B)_n a

Rule 4

· Let F(n) = #^( b₁, b₂, … , b_k-1, b_k)n

· F(n+1) = #^(F(n), F(n) … (k number of F(n)’s) … ,F(n), F(n))

· Let A = #^(b₁, b₂, … , b_k-1, b_k)_n

· How to calculate A:

o Repeat this procedure until there is only one argument and n=1

§ Apply rule 3 to A until there is only one argument

§ Apply rule 4 to A until a = 1

§ Apply rule 2 to A if n > 1

§ Repeat

o Then apply basic rule 3 and then basic rule 2 and done

[Blog post] on googology wiki