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.

Showing 1-2 of 2 results.

A263471 Total number of positive integers < 10^n with multiplicative digital root value 2.

Original entry on oeis.org

1, 9, 77, 543, 3213, 16673, 86093, 503815, 3529057, 25402097, 162303510, 884504882, 4156234265, 17270407962, 65375131342, 232901619970, 807191392546, 2795912956450, 9796747697594, 34556445906044, 120898966116007, 413105921852769, 1363586516014222
Offset: 1

Views

Author

Martin Renner, Oct 19 2015

Keywords

Comments

Partial sums of A263477.

Crossrefs

Programs

  • Mathematica
    Length@ Select[Range[10^# - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 2 &] & /@ Range@ 6 (* Michael De Vlieger, Oct 19 2015 *)
  • PARI
    t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
    a(n) = sum(i=1, 10^n - 1, if(t(i) == 2, 1, 0)); \\ Altug Alkan, Oct 19 2015

Formula

A263470(n) + A000027(n) + a(n) + A000217(n) + A263472(n) + A263473(n) + A263474(n) + A000217(n) + A263475(n) + A000292(n) = A002283(n).

Extensions

a(8) from Michael De Vlieger, Oct 19 2015
a(9)-a(23) from Hiroaki Yamanouchi, Oct 25 2015

A051813 Number of n-digit numbers with nonzero multiplicative digital root 2.

Original entry on oeis.org

1, 15, 208, 2389, 24845, 243697, 2348885, 22837227, 226507501, 2285904554, 23239957877, 235731610792, 2372897841904, 23686630752065, 235058927877399, 2327977363798607
Offset: 1

Views

Author

Dan Hoey, Dec 09 1999

Keywords

References

  • William Mayne, sci.math, Jun 15 1991

Crossrefs

Formula

# { i : 10^(n-1) < i < 10^n and A051802(i)=2 }
Showing 1-2 of 2 results.