# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a367623 Showing 1-1 of 1 %I A367623 #10 Dec 24 2023 11:48:10 %S A367623 2,1,1,0,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1, %T A367623 1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, %U A367623 1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 %N A367623 Number of comma-children of n in base 3. %H A367623 Michael S. Branicky, Table of n, a(n) for n = 1..10000 %o A367623 (Python) %o A367623 from sympy.ntheory.factor_ import digits %o A367623 def a(k, base=3): %o A367623 m = k + base*(k%base) %o A367623 return len([m+y for y in range(1, base) if digits(m+y, base)[1] == y]) %o A367623 print([a(n) for n in range(1, 96)]) # _Michael S. Branicky_, Dec 23 2023 %Y A367623 Cf. A121805, A367355, A367356, A367606-A367609, A367622. %K A367623 nonn,base %O A367623 1,1 %A A367623 _N. J. A. Sloane_, Dec 23 2023 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE