id:A160232 - OEIS Search Results

Search: id:A160232

Displaying 1-1 of 1 results found.

page 1

s(n)=the number of ways to express n as a sum of integer powers of 2 using each power no more than twice.

+0
1

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

	OFFSET	`1,2`
	LINKS	`Mathematical problemsProblem number 169`
	EXAMPLE	`4=(1+1+2=2+2=4) thus s(4)=3`
	CROSSREFS	`Sequence in context: A071912 A070940 A020651 this_sequence A002487 A060162 A026730` `Adjacent sequences: A160229 A160230 A160231 this_sequence A160233 A160234 A160235`
	KEYWORD	`nonn`
	AUTHOR	`Knut Angstrom (angstrom.knut(AT)telia.com), May 04 2009, May 05 2009`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.