User:Randomuser66/Numeros

In order of smallest to biggest
[3,4,10]

[3,4,20]

[3,4,3,33]

[3,33,333,3333]

[3000,3000,3000,3000,3000]

[v,v,v,v]

[v,v,v^2,v^3]

[prevn,100,1000,1000000]

[prevn,prevn,prevn]

prevn&&& with the number of ampersands being equal to the first number in this list, being [3,4,10]

prevn^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^prevn^2

[prevn,100,1000]

prevn + 1, this will be shown from now on as p, and numbers following p (e.g. p2) are p^n, so p2 would be p^2. pretty simple.

[p,p2,p3,p4]

[p100,p200,p300,p400]

[pG64,pG64,pG128] = This number will be coined as MegaSalad

MegaSalad&&&, with MegaSalad (MS) ampersands following that.

[MegaSalad,prevn,prevn^2] -- i think this number is larger than Large Number Garden Number

TW(prevn)

[prevn,prevn^2,prevn^3] -- these increases are slowing down...

TW(TW(TW(prevn)))))... with there being MegaSalad TWs. hope you know what i mean.

prevn$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$, with there being prevn^MS superfactorials.

Rayo(prevn) -- THAT'S A HUGE FREAKING NUMBER!!

BB(RAYO(TREE(G(PREVN))))

gan [64,64,128,prevn]

BB(prevn)

BB(BB(BB(prevn))))).... with the number of BB being prevn

SDBB(prevn)

Rayo(prevn)

prevn + 8 -- the next jump will be GINORMOUS

SN(prevn)

SN(SN(SN(prevn))))))))))).. with the number of SNs being prevn

repeat(previnc) on prevn in prevn times

$$f_{20000000}(prevn)$$, note that f here is NOT the infinity.

$$f_{prevn}(prevn)$$ wait what?

SN(SN(SNprevn))))))))))))))))))))))))))))))).. with the number of SNs being prevn^^prevn.

repeat previous step prevn times

prevn + 35, this number i call "Shrek number"