I find most if not all Oblivion extensions lazy so I have made this notation and number in an attempt to beat out all of them.
All inputs must be in the set N+.
# is any array of valid inputs or null
o(#,0)=o(#)
o(0)=Kungulus
o(1)=The largest number defined using <=kungulus symbols in a K(gongulus) system
o(n)=The largest number defined using <=o(n-1) symbols in a K(o(n-1)) system in a K2(o(n-1)) 2system in a K3(o(n-1)) 3system ... in a Ko(n-1)(o(n-1)) o(n-1)system when n>1
o(a,b)=o(o(a,b-1),b-1), b>0
o(#,0,c)=o(#,o(#,0,c-1),c-1), c>0
o(#,b,c,#)=o(#,o(#,b-1,c,#),c-1,#), b,c>0
Define a function z(n) which returns an array of n zeroes
𝒪(n)=o(1,z(n),1)
Naive Oblivion is defined as 𝒪^10(100)
Albeit the typical strengths of array notation, if Oblivion was somehow formalized and had an FGH value, this would only really grow at f_{X+w^w}. This is to say that Oblivion extensions almost never really go far.