id:A060277 - OEIS Search Results

Search: id:A060277

Displaying 1-1 of 1 results found.

page 1

Number of m for which a+b+c = n; abc = m has at least two distinct solutions (a,b,c) with 1<=a<=b<=c.

+0
1

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 1, 0, 1, 1, 3, 1, 1, 1, 1, 3, 2, 7, 3, 2, 5, 4, 3, 5, 9, 2, 5, 6, 9, 5, 9, 14, 9, 7, 5, 10, 10, 11, 18, 7, 11, 16, 14, 12, 12, 23, 19, 13, 18, 11, 20, 19, 32, 17, 21, 18, 25, 19, 21, 27, 22, 21, 31, 27, 24, 28, 42, 34, 33, 21, 28, 31, 35, 47 (list; graph; listen)

	OFFSET	`1,14`
	EXAMPLE	`(14=6+6+2=8+3+3, 72=662=833); (14=8+5+1=10+2+2, 40=851=1022); 14 has two "m" variables. so a(14)=2.`
	CROSSREFS	`Sequence in context: A117163 A096863 A117210 this_sequence A101672 A083731 A087606` `Adjacent sequences: A060274 A060275 A060276 this_sequence A060278 A060279 A060280`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (6284968128(AT)geocities.co.jp), Mar 23 2001`
	EXTENSIONS	`Description revised by David W. Wilson and Don Reble, Jun 04, 2002.`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research