# Is there a function that grows asymptotically faster than the Busy Beaver numbers?

Is there a function that grows asymptotically faster than the Busy Beaver numbers?

That is, I know that BB(n)^n grows faster than BB(n), but is there another sequence that can be shown to grow faster than BB(n) without itself referencing the busy beaver numbers in its definition?