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 A367613 #21 Feb 07 2024 13:21:43
%S A367613 1,2,3,4,5,6,7,8,9,10,11,12,13,15,16,17,19,20,21,22,23,24,25,26,28,29,
%T A367613 30,31,32,34,35,37,38,39,40,41,42,43,44,46,47,48,49,50,51,53,55,56,57,
%U A367613 58,59,60,61,62,64,65,66,67,68,69,70,73,74,75,76,77,78,79,80,82,83
%N A367613 Numbers with exactly one comma-child.
%C A367613 Complement of union of A367341 and A367346.
%C A367613 See A367338 for definition of comma-child.
%H A367613 Michael S. Branicky, <a href="/A367613/b367613.txt">Table of n, a(n) for n = 1..10000</a>
%H A367613 Eric Angelini, Michael S. Branicky, Giovanni Resta, N. J. A. Sloane, and David W. Wilson, The Comma Sequence: A Simple Sequence With Bizarre Properties, <a href="http://arxiv.org/abs/2401.14346">arXiv:2401.14346</a>, <a href="https://www.youtube.com/watch?v=_EHAdf6izPI">Youtube</a>
%t A367613 fQ[n_]:=Module[{k=n+10*Last[IntegerDigits[n]]+Range[9]},Length[Select[k,#-n==FromDigits[{Last[IntegerDigits[n]],First[IntegerDigits[#]]}]&]]]==1;
%t A367613 Select[Range[83],fQ[#]&] (* _Ivan N. Ianakiev_, Dec 16 2023 *)
%o A367613 (Python)
%o A367613 def ok(n):
%o A367613 m = n + 10*(n%10)
%o A367613 return len([m+y for y in range(1, 10) if int(str(m+y)[0]) == y]) == 1
%o A367613 print([k for k in range(1, 100) if ok(k)]) # _Michael S. Branicky_, Dec 28 2023
%Y A367613 Cf. A121895, A367341 (numbers with no comma-children), A367346 (numbers with two comma-children).
%K A367613 nonn,base
%O A367613 1,2
%A A367613 _N. J. A. Sloane_, Dec 15 2023