id:A090787 - OEIS Search Results

Search: id:A090787

Displaying 1-1 of 1 results found.

page 1

Number of ways to get n by evaluating 1 (+ or *) 2 (+ or *) 3 ... (+ or *) m for some positive integer m. No parentheses are allowed and the usual order of precedence (* before +) is followed.

+0
1

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

	OFFSET	`1,6`
	COMMENT	`Sequence suggested by Leroy Quet in SeqFan memo 3500 dated Feb 02 2004, where the first fifteen terms were given.`
	EXAMPLE	`a(55)=6, since 55 = 1+2+3+4+5+6+7+8+9+10 = 123+4+5+6+7+8+9+10 = 12+3+45+6+7+8+9 = 1+2+3+4+56+7+8 = 123+4+56+7+8 = 1+234+5*6.`
	CROSSREFS	`Sequence in context: A135055 A035148 A114114 this_sequence A096661 A098178 A007877` `Adjacent sequences: A090784 A090785 A090786 this_sequence A090788 A090789 A090790`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Feb 09 2004`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research