number of steps required to reach 1 if the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^(3/4)]+Mod[n, 2]*Floor[n^(4/3)]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}.
A095401
number of steps required to reach 1 if the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^(3/4)]+Mod[n, 2]*Floor[n^(4/3)]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}.
Terms
- a(0) =0a(1) =1a(2) =3a(3) =2a(4) =4a(5) =4a(6) =8a(7) =3a(8) =5a(9) =5a(10) =7a(11) =5a(12) =7a(13) =9a(14) =11a(15) =4a(16) =8a(17) =4a(18) =6a(19) =6a(20) =12a(21) =6a(22) =18a(23) =6a(24) =14a(25) =8a(26) =12a(27) =6a(28) =14a(29) =6
External references
- oeis: A095401