id:A082528 - OEIS Search Results

Search: id:A082528

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Conjecture : define sequence a(n,m) m real >0 as the least k such that x(k)=0 where x(1)=n x(k)=k^mfloor(x(k-1)/k^m) then a(n,m) is asymptotic to (c(m)n)^(1/(m+1)). where c(m) is a constant depending on m.`
	FORMULA	`a(n) seems to be asymptotic to (c*n)^(1/4) where c=6.76....`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=n; c=1; while(s-s%(c^3)>0, s=s-s%(c^3); c++); c)`
	CROSSREFS	`Cf. A073047.` `Sequence in context: A029243 A109829 A054125 this_sequence A055980 A076080 A134914` `Adjacent sequences: A082525 A082526 A082527 this_sequence A082529 A082530 A082531`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 30 2003`

page 1

Search completed in 0.002 seconds

Last modified December 16 13:01 EST 2009. Contains 170825 sequences.

AT&T Labs Research