login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)). 3

%I #17 Dec 28 2018 14:05:42

%S 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 9,156,9,172,10,189,10,207,10,225,11,243,11,262,12,281,12,301,12,322,

%U 13,343,13,364,13,385,14,407,14,430,14,453,15,476,15,500,16,524,16,548,16

%N 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 Parallel to A094683: values for odd arguments are same, for even not necessarily so.

%H Antti Karttunen, <a href="/A095396/b095396.txt">Table of n, a(n) for n = 1..10000</a>

%F For even n: a(n) = A048766(n^2), for odd n: a(n) = A000196(n^3). - _Antti Karttunen_, May 28 2017

%t 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 Table[If[EvenQ[n],Floor[n^(2/3)],Floor[n^(3/2)]],{n,70}] (* _Harvey P. Dale_, Dec 28 2018 *)

%o (Scheme) (define (A095396 n) (if (even? n) (A048766 (* n n)) (A000196 (* n n n)))) ;; _Antti Karttunen_, May 28 2017

%Y Cf. A000196, A007320, A048766, A094683, A094716, A095397, A095398.

%K nonn

%O 1,3

%A _Labos Elemer_, Jun 18 2004

%E Name simplified by _Antti Karttunen_, May 28 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 18:02 EDT 2024. Contains 371750 sequences. (Running on oeis4.)