254015

Appears in sequences

• Largest k > 1 such that (sum of digits of k^n)*(sum of digits of k^(n+1)) = k, or 0 if no such k exists.at n=18A130181
• Triangle read by rows: For 1 <= m <= n, t(n,m) = the smallest positive integer that when read in binary contains exactly (n+1-m) runs of 0's and 1's, all runs being of distinct lengths m through n in any order within binary t(n,m).at n=25A161000