id:A057945 - OEIS Search Results

Search: id:A057945

Displaying 1-1 of 1 results found.

page 1

Number of triangular numbers needed to represent n with greedy algorithm.

+0
4

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

	OFFSET	`0,3`
	FORMULA	`a(0)=0, otherwise a(n)=a(A002262(n))+1.`
	EXAMPLE	`a(35)=3 since 35=28+6+1`
	CROSSREFS	`Cf. A000217, A002262, A056944, A057944. See A006893 for records.` `Sequence in context: A128117 A023115 A061336 this_sequence A115452 A039676 A113126` `Adjacent sequences: A057942 A057943 A057944 this_sequence A057946 A057947 A057948`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Oct 05 2000`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research