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 A067042 #17 Jan 06 2025 03:11:41
%S A067042 11,22,33,44,55,66,77,88,99,100,111,122,133,144,155,166,177,188,199,
%T A067042 200,221,242,263,284,300,331,362,393,400,441,482,500,551,600,661,700,
%U A067042 771,800,881,900,991,1000,1001,1002,1003,1004,1005,1006,1007,1008,1009
%N A067042 Numbers in which the product of digits in even positions = product of digits in odd positions.
%H A067042 Michael S. Branicky, <a href="/A067042/b067042.txt">Table of n, a(n) for n = 1..10000</a>
%F A067042 Asymptotics: For any n, let f(n) be the number of entries in this sequence that are less than n. Then f(n)/n approaches 1 as n goes to infinity. This is because among numbers with a large number of digits, almost all have 0's in both odd positions and even positions. - _David Wasserman_, Jan 16 2002
%e A067042 2364 is a member as 2*6 = 3*4.
%t A067042 Select[Range[1010], Product[Part[(digits=IntegerDigits[#]), 2i], {i, Floor[(len=IntegerLength[#])/2]}] == Product[Part[digits, 2i-1], {i,Ceiling[len/2]}] &] (* _Stefano Spezia_, Jan 05 2025 *)
%o A067042 (Python)
%o A067042 from math import prod
%o A067042 def ok(n):
%o A067042 s = str(n)
%o A067042 return s != '1' and prod(map(int, s[::2])) == prod(map(int, s[1::2]))
%o A067042 print([k for k in range(1010) if ok(k)]) # _Michael S. Branicky_, Nov 22 2021
%Y A067042 Cf. A008593 (similar for sums).
%K A067042 base,nonn,easy
%O A067042 1,1
%A A067042 _Amarnath Murthy_, Dec 29 2001
%E A067042 Corrected by _David Wasserman_, Jan 16 2002
%E A067042 More terms from _Sascha Kurz_, Mar 23 2002