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.

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

N. J. A. Sloane, Dec 23 2023

Keywords

Crossrefs

Cf. A121805, A367338 (definition), A367341 (0's), A367346 (2's).

Programs

  • Mathematica
    f[n_]:=Module[{k=n+10*Last[IntegerDigits[n]]+Range[9]},Length[Select[k,#-n==
    FromDigits[{Last[IntegerDigits[n]],First[IntegerDigits[#]]}]&]]]; f/@Range[108] (* Ivan N. Ianakiev, Dec 24 2023 *)
  • Python
    def a(n):
        x = 10*(n%10)
        return len([y for y in range(1, 10) if str(n+x+y)[0] == str(y)])
    print([a(n) for n in range(1, 95)]) # Michael S. Branicky, Dec 23 2023