id:A082527 - OEIS Search Results

Search: id:A082527

Displaying 1-1 of 1 results found.

page 1

Least k such that x(k)=0 where x(1)=n x(k)=k^2*floor(x(k-1)/k^2).

+0
2

1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 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, 8, 8, 8, 8, 8 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) seems to be asymptotic to (c*n)^(1/3) where c=4.96....`
	EXAMPLE	`If x(1)=3 x(2)=4floor(3/4)=0 hence a(3)=2, if x(1)=10 x(2)=4floor(10/4)=2 x(3)=0 hence a(10)=3...`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=n; c=1; while(s-s%(c^2)>0, s=s-s%(c^2); c++); c)`
	CROSSREFS	`Cf. A073047.` `Sequence in context: A064099 A134021 A130255 this_sequence A132944 A106432 A029836` `Adjacent sequences: A082524 A082525 A082526 this_sequence A082528 A082529 A082530`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 30 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research