id:A085423 - OEIS Search Results

Search: id:A085423

Displaying 1-1 of 1 results found.

page 1

floor(log_2(3n)).

+0
3

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

	OFFSET	`1,2`
	COMMENT	`Length of the symmetric signed digit expansion of n with q=2 (i.e. the length of the representation of n in the (-1,0,1)_2 number system).`
	REFERENCES	`C. Heuberger and H. Prodinger, On minimal expansions in redundant number systems: Algorithms and quantitative analysis, Computing 66(2001), 377-393.`
	CROSSREFS	`Cf. A005578.` `Sequence in context: A130256 A103586 A117806 this_sequence A130241 A130247 A087839` `Adjacent sequences: A085420 A085421 A085422 this_sequence A085424 A085425 A085426`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), Jun 30 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research