# What is the smallest $n$ such that $BB(n) >$Graham's number?

BB represents the busy beaver function here. Do we even have any idea of what order of magnitude $n$ would have? Is it possibly around 10, or more like 1000?

• It was long time ago (do not have link) anyway fast check gives n = 19 but I didn't run this one.
– Evil
Jan 29, 2017 at 1:48
• @Evil Oh my apologies
– Ovi
Jan 29, 2017 at 2:04
• It is, of course, BB(8). Feb 12, 2017 at 4:11
• @wogsland Do you have a source for that?
– Ovi
Feb 12, 2017 at 4:17
• @Ovi No, but I have a force.... Feb 12, 2017 at 4:19

If I recall correctly it started with $n = 64$, then $n = 25$ shortly after that with $n=23$, $n = 22$ and now $n = 19$.