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!)
A075107 Number of steps to reach the first integer (= A075108(n)) starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached. 2

%I #10 Jan 15 2022 23:32:14

%S 0,0,0,2,0,1,1,0,5,2,0,3,2,0,0,3,3,2,0,2,1,3,0,2,2,2,0,1,1,1,2,5,3,0,

%T 16,2,4,6,0,4,16,9,2,0,1,1,1,1,0,4,2,4,8,0,2,5,2,8,0,9,3,4,5,2,0,1,1,

%U 1,1,1,0,5,7,3,2,4,0,9,4,1,2,3,0,4,1,2,1

%N Number of steps to reach the first integer (= A075108(n)) starting with n/floor(log_2(n)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.

%C Starting values given by A075105(n)/A075106(n).

%e a(5)=2 since 5/floor(log_2(5)) = 5/2 -> 15/2 -> 60 = A075108(5).

%Y Cf. A068119, A073524, A075102, A075120.

%K nonn

%O 2,4

%A _Reinhard Zumkeller_, Sep 02 2002

%E More terms from _Jinyuan Wang_, Jan 15 2022

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 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)