id:A061420 - OEIS Search Results

Search: id:A061420

Displaying 1-1 of 1 results found.

page 1

a(n) = a([(n-1)*2/3])+1 with a(0) = 0.

+0
2

0, 1, 2, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 10, 10, 10, 10, 10, 10, 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,3`
	COMMENT	`Least k such that f^(k)(n)=0 where f(x)=floor(2/3*x) and f^(k+1)(x)=f(f^(k)(x)). - Benoit Cloitre (benoit7848c(AT)orange.fr), May 26 2007`
	FORMULA	`a(n) = a(n-1)+1 if n is in A061419; a(n) = n otherwise.`
	EXAMPLE	`a(10) = a([10*2/3])+1 = a(6)+1 = 4+1 = 5.`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, s=n; c=0; while(floor(s)>0, s=floor(2/3*s); c++); c) - Benoit Cloitre (benoit7848c(AT)orange.fr), May 26 2007`
	CROSSREFS	`Cf. A029837.` `Sequence in context: A105195 A039836 A083398 this_sequence A003057 A046693 A058889` `Adjacent sequences: A061417 A061418 A061419 this_sequence A061421 A061422 A061423`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), May 02 2001`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research