id:A030308 - OEIS Search Results

Search: id:A030308

Displaying 1-1 of 1 results found.

page 1

Write n in base 2, reverse order of digits and juxtapose.

+0
13

1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`For a given number m and a digit position k the corresponding sequence index n can be calculated by n(m,k)=m*(1+floor(log_2(m)))-2^(1+floor(log_2(m)))+k+1. For example: counted from right to left, the second digit of m=13 (binary 1101) is '0'. Hence the sequence index is n=n(13,2)=39. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 05 2007`
	FORMULA	`a(n)=floor(m/2^(k-1)) mod 2, where m=max(j\|A001855(j)<n) and k=n-A001855(m). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 05 2007, Sep 10 2007`
	CROSSREFS	`Sequence in context: A000480 A118251 A099076 this_sequence A120530 A078616 A104106` `Adjacent sequences: A030305 A030306 A030307 this_sequence A030309 A030310 A030311`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research