id:A059339 - OEIS Search Results

Search: id:A059339

Displaying 1-1 of 1 results found.

page 1

A+B=C for 0<=A, 0<=B, A<=B; if n is a C-almost prime then a(n) = number of decompositions of n into sum of an A-almost prime and a B-almost prime.

+0
1

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

	OFFSET	`1,10`
	COMMENT	`E.g. n=10, 10 is 2-almost prime (semiprime). Therefore C=2. 10=1+9(A=0,B=2); 10=7+3(A=1,B=1); 10=5+5(A=1,B=1), so a(10)=3.`
	CROSSREFS	`Sequence in context: A067169 A011339 A118514 this_sequence A092735 A035464 A019746` `Adjacent sequences: A059336 A059337 A059338 this_sequence A059340 A059341 A059342`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jan 27 2001`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research