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.

1, 1, 1, 1, 1, 1, 1, 7, 7, 5, 12, 20, 11, 54, 10, 15, 20, 19, 43, 30, 18, 5, 55, 25, 63, 28, 21, 29, 15, 22, 5, 85, 18, 34, 41, 81, 16, 14, 13, 15, 32, 49, 22, 5, 165, 10, 25, 9, 84, 99, 18, 129, 10, 41, 146, 35, 9, 39, 50, 40, 16, 59, 63, 65, 19, 258, 136, 115, 11, 15, 169, 26

Offset

1,8

Links

Table of n, a(n) for n=1..72.

Prog

(PARI) a(n)=if(n<0, 0, s=n; c=1; while(floor(s*Pi)%n>0, s=floor(s*Pi); c++); c)

Crossrefs

Sequence in context: A021932 A244675 A065472 * A096151 A021567 A019619

Adjacent sequences: A081109 A081110 A081111 * A081113 A081114 A081115

Keyword

nonn

Author

Benoit Cloitre, Apr 15 2003

Status

approved