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-3 of 3 results.

A053041 Smallest n-digit number divisible by n.

Original entry on oeis.org

1, 10, 102, 1000, 10000, 100002, 1000006, 10000000, 100000008, 1000000000, 10000000010, 100000000008, 1000000000012, 10000000000004, 100000000000005, 1000000000000000, 10000000000000016, 100000000000000008, 1000000000000000018, 10000000000000000000
Offset: 1

Views

Author

Henry Bottomley, Feb 24 2000

Keywords

Crossrefs

Programs

Formula

a(n) = n*ceiling(10^(n-1)/n). - Vladeta Jovovic, Dec 27 2001

Extensions

More terms from David Wasserman, Feb 26 2002

A066557 Largest n-digit multiple of n.

Original entry on oeis.org

9, 98, 999, 9996, 99995, 999996, 9999997, 99999992, 999999999, 9999999990, 99999999990, 999999999996, 9999999999990, 99999999999998, 999999999999990, 9999999999999984, 99999999999999990, 999999999999999990, 9999999999999999990, 99999999999999999980
Offset: 1

Views

Author

Amarnath Murthy, Dec 17 2001

Keywords

Crossrefs

Programs

Formula

a(n) = floor((10^n-1)/n)*n.

Extensions

More terms and formula from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Dec 24 2001

A066559 a(n) = ceiling(10^(n-1)/n).

Original entry on oeis.org

1, 5, 34, 250, 2000, 16667, 142858, 1250000, 11111112, 100000000, 909090910, 8333333334, 76923076924, 714285714286, 6666666666667, 62500000000000, 588235294117648, 5555555555555556, 52631578947368422, 500000000000000000
Offset: 1

Views

Author

Amarnath Murthy, Dec 17 2001

Keywords

Crossrefs

Programs

Formula

a(n) = A053041(n)/n.

Extensions

Corrected, extended by, and better name from Vladeta Jovovic, Dec 17 2001
Showing 1-3 of 3 results.