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 A361341 #15 Apr 09 2023 07:56:54
%S A361341 112,113,114,115,116,117,119,122,123,124,126,127,128,129,132,133,134,
%T A361341 135,136,137,138,142,143,144,146,147,153,155,157,159,162,163,166,168,
%U A361341 169,172,173,175,176,177,178,182,183,184,186,193,198,199,211,213,221,224,228,229,231,233,234,235,241,243,244,248,253,259,264,268,272,273,275,281,282
%N A361341 Numbers k such that A361338(k) = 2.
%H A361341 Michael De Vlieger, <a href="/A361341/b361341.txt">Table of n, a(n) for n = 1..7920</a>
%e A361341 From _M. F. Hasler_, Apr 08 2023: (Start)
%e A361341 From 112 we can get 1*12 = 12 and 11*2 = 22, then 1*2 = 2 and 2*2 = 4.
%e A361341 All smaller numbers have only one possible outcome: for n = 111 the only possible outcome is 1, for 99 < n < 111, the outcome is always 0, and for 2-digit numbers there is only one possibility for the split-and-multiply operation and the result is always smaller than the initial value. (End)
%t A361341 -1 + Position[#, 2][[All, 1]] &@ Flatten@ Array[Map[Total, Transpose@ ImageData[ColorNegate@ Import["https://oeis.org/A361338/a361338_2.png", "PNG"], "Bit"][[10 # + 1 ;; 10 # + 10, 1 ;; 1000]]] &, 1, 0] (* _Michael De Vlieger_, Apr 06 2023, using image at A361338 *)
%o A361341 (PARI) select( {is_A361341(n)=A361338(n)==2}, [0..300]) \\ _M. F. Hasler_, Apr 08 2023
%Y A361341 Cf. A361338-A361349.
%K A361341 nonn,base
%O A361341 1,1
%A A361341 _N. J. A. Sloane_, Apr 05 2023