id:A145172 - OEIS Search Results

Search: id:A145172

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`1,2`
	COMMENT	`Sequence is unbounded.`
	EXAMPLE	`a(21)=6 since 21=12+5+1+1+1+1`
	CROSSREFS	`Sequence in context: A053344 A092196 A100878 this_sequence A053824 A033925 A064866` `Adjacent sequences: A145169 A145170 A145171 this_sequence A145173 A145174 A145175`
	KEYWORD	`nonn`
	AUTHOR	`Christina Steffan (christina.steffan(AT)gmx.at), Oct 03 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.