cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Jonathan Vos Post, Nov 30 2004

Keywords

Examples

			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

Formula

a(n) = max{i such that i = A001358(j) + A001358(k) in n ways}.