H. M. Friedman's n(k) function has the following lower bound for n(4) --
A(A(A(............A(A(1))...) where there are A(187196) A's.
A(k) is defined as A(k,k), the Ackermann function.
Graham's number is defined--
1. g(0) = 3^^^^3
2. construct g(1) = 3^^......^^3 where there are g(0) up arrows
3. construct g(2) = 3^^......^^3 where there are g(1) up arrows
4. construct g(3) = 3^^......^^3 where there are g(2) up arrows
.
.
.
65.construct g(64)=3^^......^^3 where there are g(63) up arrows
= Graham's upper bound

Anyone have an idea on which is the larger number,Friedman's lower bound or Graham's number? http://mathforum.org/discuss/sci.math/m/433653/509458

is an assertion that Friedman's is the larger number

Here is a interpretation of an arrow chain--