id:A055401 - OEIS Search Results

Search: id:A055401

Displaying 1-1 of 1 results found.

page 1

Number of positive cubes needed to sum to n using the greedy algorithm.

+0
4

1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7, 8, 9, 10, 4, 5, 6, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7, 8, 9, 10, 4, 5, 6, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Define f(n) = n - k^3 where (k+1)^3 > n >= k^3; a(n) = number of steps such that f(f(...f(n)))= 0.`
	FORMULA	`a(n) = a(n-floor(n^(1/3))^3)+1 = a(A055400(n))+1 = a(n-A048762(n))+1 [with a(0) = 0]`
	EXAMPLE	`a(33)=7 because 33=27+1+1+1+1+1+1 (not 33=8+8+8+8+1)`
	CROSSREFS	`Cf. A018888, A055400.` `Sequence in context: A053843 A010886 A002376 this_sequence A053829 A033928 A050985` `Adjacent sequences: A055398 A055399 A055400 this_sequence A055402 A055403 A055404`
	KEYWORD	`easy,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), May 16 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research