cp's OEIS Frontend

A378515 Smallest n-digit number whose digits can be divided into an even number of substrings s_i (where i <= n) such that the sum of s_j^s_k (where j <= n and k <= n), with each substring used only once, equals the number k itself, or -1 if no such number exists.

Original entry on oeis.org

			25 = 5^2;
4096 = 4^6 + 0^9;
15626 = 1^26 + 5^6;
117650 = 1^1 + 7^6 + 0^5;
1015626 = 10^6 + 1^2 + 5^6;
10077696 = 0^1 + 0^776 + 6^9;
100015628 = 10^8 + 0^0 + 2^1 + 5^6.