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.

A387100 a(n) is the least number that can be written in exactly n ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t}.

This page as a plain text file.
%I A387100 #13 Aug 26 2025 00:40:06
%S A387100 4,545,23506,331979,5260225,10630307
%N A387100 a(n) is the least number that can be written in exactly n ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t}.
%e A387100 a(5) = 5260225 via
%e A387100 5260225 = 2^22 + 3^8 + 4^5 + 5^2 + 7^7 + 8^3 + 22^4
%e A387100         = 2^21 + 3^8 + 4^10 + 7^3 + 8^7 + 10^4 + 21^2
%e A387100         = 2^7 + 3^14 + 4^5 + 5^8 + 6^6 + 7^3 + 8^2 + 14^4
%e A387100         = 2^15 + 3^10 + 4^9 + 5^5 + 6^4 + 7^6 + 9^7 + 10^3 + 15^2
%e A387100         = 2^11 + 3^7 + 4^10 + 5^9 + 6^8 + 7^3 + 8^5 + 9^6 + 10^4 + 11^2,
%e A387100 and no positive integer smaller than 5260225 can be written as such in exactly five ways.
%Y A387100 Cf. A385969, A386968.
%K A387100 nonn,more,new
%O A387100 1,1
%A A387100 _David A. Corneth_, Aug 16 2025