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.

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