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.