This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A114868 #6 Jul 11 2015 10:43:26 %S A114868 1,0,0,1,1,1,1,2,3,2,3,4,7,6,7,10,17,14,18,26,41,36,44,64,104,91,112, %T A114868 163 %N A114868 a(n) = floor(n^(n/4)/n!!!!). %C A114868 This sequence is an approximation to a quadruple factorial analog of Stirling's approximation to the factorial function. Note that a(n) is exact for n = 1, 4, 8. %F A114868 a(n) = floor(n^(n/4)/n!!!). a(n) = floor((A000312(n)^(1/4))/A007662(n)). %e A114868 a(8) = floor((8^2)/8!!!!) = floor((8^2)/32) = floor(2) = 2. %e A114868 a(9) = floor((9^2.25)/9!!!!) = floor((9^2.25)/45) = floor(3.11769145) = 3. %e A114868 a(16) = floor((16^4)/16!!!!) = floor((16^4)/6144) = floor(10.6666667) = 10. %e A114868 a(20) = floor((20^5)/20!!!!) = floor((20^5)/122880) = floor(26.0416667) = 26. %Y A114868 Cf. A000312, A006882, A055775, A007662. %K A114868 easy,nonn %O A114868 1,8 %A A114868 _Jonathan Vos Post_, Feb 20 2006