id:A063695 - OEIS Search Results

Search: id:A063695

Displaying 1-1 of 1 results found.

page 1

Remove even-positioned bits from the binary expansion of n.

+0
3

0, 0, 2, 2, 0, 0, 2, 2, 8, 8, 10, 10, 8, 8, 10, 10, 0, 0, 2, 2, 0, 0, 2, 2, 8, 8, 10, 10, 8, 8, 10, 10, 32, 32, 34, 34, 32, 32, 34, 34, 40, 40, 42, 42, 40, 40, 42, 42, 32, 32, 34, 34, 32, 32, 34, 34, 40, 40, 42, 42, 40, 40, 42, 42, 0, 0, 2, 2, 0, 0, 2, 2, 8, 8, 10, 10, 8, 8, 10, 10, 0, 0 (list; graph; listen)

	OFFSET	`0,3`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`a(n) = 2(floor(n/2)-a(floor(n/2))). - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 23 2003` `G.f. 1/(1-x) sum(k>=0, (-2)^k*2t^2/(1-t^2), t=x^2^k). Members of A004514 written twice. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 06 2003`
	EXAMPLE	`E.g. a(25) = 8 because 25 = 11001 in binary and when we AND this with 1010 we are left with 1000 = 8.`
	MAPLE	`[seq(every_other_pos(j, 2, 1), j=0..120)]; Function every_other_pos given at A063694.`
	CROSSREFS	`A001477[n] = A063694[n]+a[n]` `Sequence in context: A015818 A039972 A031124 this_sequence A081417 A133388 A158092` `Adjacent sequences: A063692 A063693 A063694 this_sequence A063696 A063697 A063698`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Aug 03 2001`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research