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.

A365493 a(n) is the smallest number which can be represented as the sum of n n-almost primes in exactly n ways, or -1 if no such number exists.

Original entry on oeis.org

2, 18, 44, 112, 418, 776, 1408, 3072, 7040, 14848, 53056, 77312, 147456, 315392, 988160, 5310464, 3194880, 6225920, 12845056, 46252032, 76873728, 117440512, 258998272, 1072824320, 1111490560, 3379560448, 5192548352, 9261023232, 24243077120, 41204842496, 81067507712
Offset: 1

Views

Author

Ilya Gutkovskiy, Sep 07 2023

Keywords

Examples

			For n = 2: 18 = 2*2 + 2*7 = 3*3 + 3*3.
		

Crossrefs

Extensions

More terms from David A. Corneth, Jun 12 2025