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.

A090490 For n > 1, a(n) is the least multiple of n that can be obtained by adding one digit to each end of a(n-1).

Table of values

n a(n)
1 1
2 110
3 11100
4 1111000
5 111110000
6 11111100000
7 1111111000006
8 111111110000064
9 11111111100000648
10 1111111111000006480
11 111111111110000064800
12 11111111111100000648000
13 1111111111111000006480005
14 111111111111110000064800052
15 11111111111111100000648000525

List of values

[1, 110, 11100, 1111000, 111110000, 11111100000, 1111111000006, 111111110000064, 11111111100000648, 1111111111000006480, 111111111110000064800, 11111111111100000648000, 1111111111111000006480005, 111111111111110000064800052, 11111111111111100000648000525]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.