id:A061336 - OEIS Search Results

Search: id:A061336

Displaying 1-1 of 1 results found.

page 1

Smallest number of triangular numbers which sum to n.

+0
3

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

	OFFSET	`0,3`
	COMMENT	`a(n)=3 if n=5 or 8 mod 9, since triangular numbers are {0,1,3,6} mod 9.`
	EXAMPLE	`a(3)=1 since 3=3, a(4)=2 since 4=1+3, a(5)=3 since 5=1+1+3, with 1 and 3 being triangular.`
	CROSSREFS	`0 if n=0, otherwise 1 if n is in A000217, otherwise 2 if n is in A051533, otherwise 3 in which case n is in A020757. Cf. A000217, A007294, A057945, A061337.` `Sequence in context: A098053 A128117 A023115 this_sequence A057945 A115452 A039676` `Adjacent sequences: A061333 A061334 A061335 this_sequence A061337 A061338 A061339`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Apr 25 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research