Let s(x)=floor(phi*x) where phi is the golden ratio (1+sqrt(5))/2; 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 number exists.
A081111
Let s(x)=floor(phi*x) where phi is the golden ratio (1+sqrt(5))/2; 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 number exists.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =6a(4) =4a(5) =6a(6) =16a(7) =4a(8) =5a(9) =3a(10) =10a(11) =3a(12) =6a(13) =3a(14) =6a(15) =3a(16) =6a(17) =8a(18) =6a(19) =13a(20) =6a(21) =20a(22) =14a(23) =24a(24) =7a(25) =16a(26) =58a(27) =26a(28) =14a(29) =16
External references
- oeis: A081111