id:A087793 - OEIS Search Results

Search: id:A087793

Displaying 1-1 of 1 results found.

page 1

Least k such that S^k(n)=n^2 where S(x)=n*ceiling(sqrt(x)).

+0
1

0, 2, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`For all m>k, S^m(n)=n^2`
	FORMULA	`a(n)=sqrt(n)+o(sqrt(n))`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, z=1; c=0; while(abs(z-n^2)>0, z=n*ceil(sqrt(z)); c++); c)`
	CROSSREFS	`Sequence in context: A136528 A130242 A130245 this_sequence A030411 A132913 A003160` `Adjacent sequences: A087790 A087791 A087792 this_sequence A087794 A087795 A087796`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 07 2003`

page 1

Search completed in 0.004 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research