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.

A265182 Base-10 analog of Marko Riedel's A265008.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 0, 5, 0, 0, 1, 1, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 1, 0, 0, 1, 0, 5, 1, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0
Offset: 1

Views

Author

N. J. A. Sloane, Dec 04 2015

Keywords

Crossrefs

See A265183 for the version where A, B, C may be zero.
Cf. A218978.

Programs

  • Haskell
    a265182 n = length [() | let cs = dropWhile (== 0) $ a218978_row n, c <- cs,
                let as = takeWhile (<= c) cs, a <- as, b <- as, a * b == c]
    -- Reinhard Zumkeller, Dec 05 2015
  • Maple
    F:= proc(n) local L, ss;
      L:= convert(n, base, 10);
      ss:= {seq(seq(add(10^(i-j)*L[i], i=j..k), j=1..k), k=1..nops(L))} minus {0};
      numboccur(true, [seq(seq(member(a*b, ss), a=ss), b=ss)]);
    end proc:
    seq(F(n), n=1..1000); # Robert Israel, Dec 06 2015

Extensions

Corrected by Lars Blomberg, Dec 05 2015