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 A095396 #17 Dec 28 2018 14:05:42 %S A095396 1,1,5,2,11,3,18,4,27,4,36,5,46,5,58,6,70,6,82,7,96,7,110,8,125,8,140, %T A095396 9,156,9,172,10,189,10,207,10,225,11,243,11,262,12,281,12,301,12,322, %U A095396 13,343,13,364,13,385,14,407,14,430,14,453,15,476,15,500,16,524,16,548,16 %N A095396 Modified juggler map: for even numbers: a(n) = floor(n^(2/3)) and for odd n: a(n) = floor(n^(3/2)) = floor(sqrt(n^3)). %C A095396 Parallel to A094683: values for odd arguments are same, for even not necessarily so. %H A095396 Antti Karttunen, <a href="/A095396/b095396.txt">Table of n, a(n) for n = 1..10000</a> %F A095396 For even n: a(n) = A048766(n^2), for odd n: a(n) = A000196(n^3). - _Antti Karttunen_, May 28 2017 %t A095396 d[x_]:=d[x]=(1-Mod[x, 2])*Floor[N[x^(2/3), 50]] +Mod[x, 2]*Floor[N[x^(3/2), 50]];d[1]=1; Table[d[w], {w, 1, 150}] %t A095396 Table[If[EvenQ[n],Floor[n^(2/3)],Floor[n^(3/2)]],{n,70}] (* _Harvey P. Dale_, Dec 28 2018 *) %o A095396 (Scheme) (define (A095396 n) (if (even? n) (A048766 (* n n)) (A000196 (* n n n)))) ;; _Antti Karttunen_, May 28 2017 %Y A095396 Cf. A000196, A007320, A048766, A094683, A094716, A095397, A095398. %K A095396 nonn %O A095396 1,3 %A A095396 _Labos Elemer_, Jun 18 2004 %E A095396 Name simplified by _Antti Karttunen_, May 28 2017