Let s(x)=floor(Pi*x); sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such k exists.
A081112
Let s(x)=floor(Pi*x); sequence gives the least k such that n divides s^k(n) where s^k(x) denotes s(s(s..s(x))..) k times, or 0 if no such k exists.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =7a(8) =7a(9) =5a(10) =12a(11) =20a(12) =11a(13) =54a(14) =10a(15) =15a(16) =20a(17) =19a(18) =43a(19) =30a(20) =18a(21) =5a(22) =55a(23) =25a(24) =63a(25) =28a(26) =21a(27) =29a(28) =15a(29) =22
External references
- oeis: A081112