id:A100593 - OEIS Search Results

Search: id:A100593

Displaying 1-1 of 1 results found.

page 1

Greatest positive integer that can be represented as the sum of exactly two semiprimes in exactly n ways.

+0
1

33, 62, 105, 122, 135, 174, 285, 214, 294, 315, 318, 366, 525, 405, 394, 474, 498, 585, 495, 529, 765, 645, 735, 693, 945, 705, 761, 825, 1155, 1109, 901, 989, 1049, 1123, 1365, 1063, 1121, 1181, 1243, 1129, 1231, 1169, 1349, 1485, 1399, 1577 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`a(n) = max{i such that i = A001358(j) + A001358(k) in n ways}.`
	EXAMPLE	`a(0) = 33 is only a conjecture, based on computer searches by Lior Manor and by Ray Chandler. a(1) = 62 because 62 = 58 + 4 is the only way to partition 62 into two semiprimes.`
	CROSSREFS	`Cf. A001358, A076768, A100570, A072966.` `Adjacent sequences: A100590 A100591 A100592 this_sequence A100594 A100595 A100596` `Sequence in context: A043983 A080673 A140156 this_sequence A115160 A053179 A116350`
	KEYWORD	`nonn`
	AUTHOR	`Jonathan Vos Post (jvospost2(AT)yahoo.com), Nov 30 2004`

page 1

Search completed in 0.002 seconds

Last modified October 13 02:37 EDT 2008. Contains 145008 sequences.

AT&T Labs Research