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 A321243 #53 Oct 29 2024 14:17:32
%S A321243 0,1,2,3,4,5,6,7,8,9,0,11,24,39,56,75,96,119,144,171,0,21,44,69,96,
%T A321243 125,156,189,224,261,0,31,64,99,136,175,216,259,304,351,0,41,84,129,
%U A321243 176,225,276,329,384,441,0,51,104,159,216,275,336,399,464,531
%N A321243 a(n) is the product of n and all its decimal digits individually except the leftmost digit.
%C A321243 First differs from A067079 at n=102: A067079(102) = 408 != a(102) = 0.
%H A321243 Jacob Swales, <a href="/A321243/b321243.txt">Table of n, a(n) for n = 0..10000</a>
%e A321243 a(33) = 33*3 = 99. a(234) = 234*3*4 = 2808.
%t A321243 a[n_] := n * If[n<10, 1, Times@@Rest[IntegerDigits[n]]]; Array[a, 100, 0] (* _Amiram Eldar_, Nov 15 2018 *)
%t A321243 Table[n Times@@Rest[IntegerDigits[n]],{n,0,60}] (* _Harvey P. Dale_, Mar 06 2023 *)
%o A321243 (Python)
%o A321243 def a(n):
%o A321243 seq_num = n
%o A321243 for letter in range(len(str(n))):
%o A321243 if letter != 0:
%o A321243 seq_num = seq_num * int(str(n)[letter])
%o A321243 return seq_num
%Y A321243 Cf. A067079.
%K A321243 nonn,base
%O A321243 0,3
%A A321243 _Jacob Swales_, Nov 14 2018