id:A073047 - OEIS Search Results

Search: id:A073047

Displaying 1-1 of 1 results found.

page 1

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

+0
4

2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Length of n-th run of consecutive identical terms is given by A028913 - Ralf Stephan (ralf(AT)ark.in-berlin.de).`
	FORMULA	`Presumably a(n)=sqrt(Pi*n)+O(1)`
	EXAMPLE	`If x(1)=4, x(2)= 2floor(4/2)=4, x(3)=3floor(4/3)=3; x(4)=4*floor(3/4)=0 hence a(4)=4.`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=n; c=1; while(s-s%c>0, s=s-s%c; c++); c)`
	CROSSREFS	`Cf. A002491, A007952, A082527, A082528.` `Sequence in context: A072073 A061716 A126236 this_sequence A038567 A036234 A061091` `Adjacent sequences: A073044 A073045 A073046 this_sequence A073048 A073049 A073050`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 31 2002; revised May 03 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research