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.

A173479 a(n) = the smallest n-digit number ending in n-1 zeros that is divisible by n, else 0.

Original entry on oeis.org

1, 10, 300, 1000, 10000, 300000, 7000000, 10000000, 900000000, 1000000000, 0, 300000000000, 0, 70000000000000, 300000000000000, 1000000000000000, 0, 900000000000000000, 0, 10000000000000000000, 0, 0, 0, 300000000000000000000000, 1000000000000000000000000, 0, 0, 7000000000000000000000000000, 0
Offset: 1

Views

Author

Jaroslav Krizek, Feb 19 2010

Keywords

Comments

Programs

  • Maple
    f:= proc(n) local i; for i from 1 to 9 do if i*10^(n-1) mod n = 0 then return i*10^(n-1) fi od: 0 end proc:
    map(f, [$1..20]); # Robert Israel, Jan 16 2017

Extensions

a(16)-a(29) from Robert Israel, Jan 16 2017