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

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

Offset

0,1

Links

Table of n, a(n) for n=0..45.

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.

Sequence in context: A080673 A140156 A154600 * A115160 A053179 A183347

Adjacent sequences: A100590 A100591 A100592 * A100594 A100595 A100596

Keyword

nonn

Author

Jonathan Vos Post, Nov 30 2004

Status

approved