cp's OEIS Frontend

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.

A367622 Number of comma-children of n in base 10.

This page as a plain text file.
%I A367622 #18 Dec 25 2023 13:30:48
%S A367622 1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,2,1,
%T A367622 1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,2,1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,
%U A367622 1,1,2,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1
%N A367622 Number of comma-children of n in base 10.
%H A367622 Michael S. Branicky, <a href="/A367622/b367622.txt">Table of n, a(n) for n = 1..10000</a>
%t A367622 f[n_]:=Module[{k=n+10*Last[IntegerDigits[n]]+Range[9]},Length[Select[k,#-n==
%t A367622 FromDigits[{Last[IntegerDigits[n]],First[IntegerDigits[#]]}]&]]]; f/@Range[108] (* _Ivan N. Ianakiev_, Dec 24 2023 *)
%o A367622 (Python)
%o A367622 def a(n):
%o A367622     x = 10*(n%10)
%o A367622     return len([y for y in range(1, 10) if str(n+x+y)[0] == str(y)])
%o A367622 print([a(n) for n in range(1, 95)]) # _Michael S. Branicky_, Dec 23 2023
%Y A367622 Cf. A121805, A367338 (definition), A367341 (0's), A367346 (2's).
%K A367622 nonn,base
%O A367622 1,14
%A A367622 _N. J. A. Sloane_, Dec 23 2023