1.序数0,fgh下f_0(n)=n+1
2.序数1,fgh下f_1(n)=n2
3.序数2,fgh下f_2(n)=n*2^n
4.序数4,n^^n的增长率=n,n,2
5.序数ω=FTO,高德纳箭头的增长率=n,n,n
6.序数ω+1,f_ω+1(64)~葛立恒数=n,n,n,2
7.序数ω2,四段康威链的增长率~n,n,n,3?
8.序数ω^2,康威链的增长率=n,n,n,n,n
9.序数ω^3,下标康威链的增长率=n/5
10.序数ω^ω=LAO,线性数阵(LAN)的增长率,mgh和fgh的catching点,-2-Y的极限=n/n
11.序数ω^ω^ω,Dimentional Arrays的增长率=n/n,n
12.序数ε₀=SCO,PrSS,-1-Y的极限,HH和fgh的catching点,PTO(PA)=n/n/n
13.序数ε_ω,PEAN的fgh增长率,PTO((Π¹₀-TR)₀)=n/n/n/2
14.序数ζ₀=CO,第一个a满足a=ε_a=n/n/n/n
15.序数η₀=LCO,第一个a满足a=ζ_a=n/n/n/n/n
16.序数φ(ω,0)=HCO,LPrSS的极限=n//n
17.序数Γ₀=FSO,弱φ的极限=n//n//n
18.序数φ(ω,0,0),ω-Dropping Worm的极限=n///n
19.序数φ(1,0,0,0)=ACO,E#的极限增长率=n////n
20.序数φ(1@ω)=SVO,tree函数的增长率,有限元φ的强度,TREE函数的增长率比它略大=n/(n)n