id:A062535 - OEIS Search Results

Search: id:A062535

Displaying 1-1 of 1 results found.

page 1

Don't be greedy! Difference between number of squares needed to sum to n using the greedy algorithm and using the best such sum.

+0
2

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

	OFFSET	`1,32`
	FORMULA	`a(n) =A053610(n)-A002828(n).`
	EXAMPLE	`a(32)=5-2=3 since 32 can be written greedily as 25+4+1+1+1 or efficiently as 16+16.`
	CROSSREFS	`Sequence in context: A061853 A010104 A030121 this_sequence A151795 A008437 A151755` `Adjacent sequences: A062532 A062533 A062534 this_sequence A062536 A062537 A062538`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 25 2001`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research