id:A027615 - OEIS Search Results

Search: id:A027615

Displaying 1-1 of 1 results found.

page 1

Number of 1's when n is written in base -2.

+0
1

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

	OFFSET	`0,3`
	REFERENCES	`J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 164.`
	FORMULA	`a(n) = 3 * A072894(n+1) - 2n - 3. Proof by Nikolaus Meyberg, following a conjecture by Ralf Stephan.`
	CROSSREFS	`Sequence in context: A104246 A007720 A129968 this_sequence A053737 A033924 A003315` `Adjacent sequences: A027612 A027613 A027614 this_sequence A027616 A027617 A027618`
	KEYWORD	`nonn`
	AUTHOR	`Pontus von Bromssen (pontus.von.bromssen(AT)gmail.com)`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:40 EDT 2008. Contains 143238 sequences.

AT&T Labs Research