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 A380891 #40 May 05 2025 16:44:45 %S A380891 0,1,1,4,1,8,1,13,2,18,2,24,2,30,2,36,2,43,2,50,2,57,2,65,2,73,2,81,3, %T A380891 89,3,97,3,105,3,114,3,123,3,132,3,141,3,150,3,160,3,169,3,179,3,189, %U A380891 3,199,3,209,3,219,3,229,3,240,3,250,4,261,4,272 %N A380891 If n mod 2 = 0 then a(n) = floor(n^(1/3)) else a(n) = floor(n^(4/3)). %t A380891 a[n_]:=If[Mod[n,2]==0,Floor[n^(1/3)],Floor[n^(4/3)]]; (* _James C. McMahon_, Apr 11 2025 *) %o A380891 (Python) %o A380891 import gmpy2 %o A380891 def a(n): return int(gmpy2.iroot(n**4 if n&1 else n, 3)[0]) %Y A380891 Interspersion of A048766 and A129011. %Y A380891 Cf. A094683, A381246, A383135. %K A380891 nonn,easy %O A380891 0,4 %A A380891 _Vikram Prasad_, Feb 08 2025