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.
%I A282782 #47 Feb 18 2021 01:36:20
%S A282782 0,1,2,3,4,5,6,7,8,9,1715
%N A282782 Numbers that are equal to a product of powers of digits where the exponents from left to right decrease with 1 and the exponent for the units digit is 1.
%C A282782 Up to 10^9 no other number matches the rule.
%C A282782 There are no other terms up to 10^200; this list is probably complete. - _Charles R Greathouse IV_, Feb 22 2017
%e A282782 1 = 1^1, 2 = 2^1, ..., 1715 = (1^4)*(7^3)*(1^2)*(5^1).
%e A282782 These numbers do not match the rule:
%e A282782 46: (4^2)*(6^1) = 96 <> 46.
%e A282782 234: (2^3)*(3^2)*(4^1) = 288 <> 234.
%e A282782 4342: (4^4)*(3^3)*(4^2)*(2^1) = 221184 <> 4342.
%e A282782 46914: (4^5)*(6^4)*(9^3)*(1^2)*(4^1) = 3869835264 <> 46914.
%t A282782 mx = 10^50; test[n_] := n == Times @@ (IntegerDigits[n] ^Reverse[Range@ IntegerLength@ n]); Union@Reap[Do[n = 2^i 3^j 7^k; If[test@n, Sow@n], {i, 0, Log2[mx]}, {j, 0, Log[3, mx/2^i]}, {k, 0, Log[7, mx/2^i/3^j]}]; Do[n = 5 3^j 7^k; If[test@n, Sow@n], {j, 0, Log[3, mx/5]}, {k, 0, Log[7, mx/ 5/ 3^j]}]][[2, 1]] (* Search up to 10^50, _Giovanni Resta_, Feb 22 2017 *)
%t A282782 Select[Range[0, 2000], Times @@ MapIndexed[#1^First[#2] &, Reverse@ IntegerDigits@ #] == # &] (* _Michael De Vlieger_, Feb 22 2017 *)
%o A282782 (VBA) ' For example for 5-figure numbers:
%o A282782 Dim zahl As String
%o A282782 For i = 10000 To 99999
%o A282782 zahl = i
%o A282782 If i = CInt(Left(zahl, 1)) ^ 5 * CInt(Right(Left(zahl, 2), 1)) ^ 4 * CInt(Right(Left(zahl, 3), 1)) ^ 3 * CInt(Right(Left(zahl, 4), 1)) ^ 2 * CInt(Right(zahl, 1)) ^ 1 Then
%o A282782 MsgBox (i)
%o A282782 End If
%o A282782 Next i
%o A282782 (PARI) is(n)=my(d=digits(n)); prod(i=1,#d,d[#d+1-i]^i)==n || !n \\ _Charles R Greathouse IV_, Feb 22 2017
%o A282782 (PARI) list(lim)=my(v=List([0]),t7,t37,t); for(a=0,logint(lim\1,7), t7=7^a; for(b=0,logint(lim\t7,3), t=t37=t7*3^b; while(t<=lim, if(is(t), listput(v,t)); t<<=1); t=t37; while(t<=lim, if(is(t), listput(v,t)); t*=5))); Set(v) \\ _Charles R Greathouse IV_, Feb 22 2017
%Y A282782 Subsequence of A002473; apart from the first term, a subsequence of A238985.
%K A282782 nonn,base
%O A282782 1,3
%A A282782 _Shmelev Aleksei_, Feb 21 2017
%E A282782 Leading 0 prepended by _David A. Corneth_, Feb 22 2017