id:A081112 - OEIS Search Results

Search: id:A081112

Displaying 1-1 of 1 results found.

page 1

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.

+0
1

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 (list; graph; listen)

	OFFSET	`1,8`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=n; c=1; while(floor(sPi)%n>0, s=floor(sPi); c++); c)`
	CROSSREFS	`Sequence in context: A154193 A021932 A065472 this_sequence A096151 A021567 A019619` `Adjacent sequences: A081109 A081110 A081111 this_sequence A081113 A081114 A081115`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 15 2003`

page 1

Search completed in 0.002 seconds

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.

AT&T Labs Research