id:A089400 - OEIS Search Results

Search: id:A089400

Displaying 1-1 of 1 results found.

page 1

a(n) = m - A089398(2^m - n) for m>=n.

+0
6

0, 2, 2, 2, 1, 4, 2, 2, 1, 3, 3, 3, 3, 4, 2, 2, 1, 3, 3, 3, 2, 5, 3, 3, 2, 4, 4, 5, 3, 4, 2, 2, 1, 3, 3, 3, 2, 5, 3, 3, 2, 4, 4, 4, 4, 5, 3, 3, 2, 4, 4, 4, 3, 6, 4, 4, 3, 5, 6, 5, 3, 4, 2, 2, 1, 3, 3, 3, 2, 5, 3, 3, 2, 4, 4, 4, 4, 5, 3, 3, 2, 4, 4, 4, 3, 6, 4, 4, 3, 5, 5, 6, 4, 5, 3, 3, 2, 4, 4, 4, 3, 6, 4, 4, 3 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`A089398(n) = n-th column sum of binary digits of k*2^(k-1), where summation is over all k>=1, without carrying from columns sums that may exceed 2.`
	FORMULA	`a(2^k)=1 (for k>1), a(2^k+j)=1+a(j) (for 2^k-k>j>=0), a(2^k-j)=1+A089401(j) (for k>j>0).`
	EXAMPLE	`a(6)=4 since 7 - A089398(2^7 - 6) = 7 - 3 = 4.`
	CROSSREFS	`Cf. A089398, A089401.` `Sequence in context: A004065 A127496 A144393 this_sequence A105777 A014572 A071458` `Adjacent sequences: A089397 A089398 A089399 this_sequence A089401 A089402 A089403`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Oct 30 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research