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.

A134595 a(n) is the smallest number such that, for any m, the number formed from the first m digits of a(n) is congruent to n mod m; but no digit can be appended to maintain the condition.

Table of values

n a(n)
0 1080548820
1 1121114531
2 1010249842
3 1115859543
4 1064928464
5 1105018975
6 1026605496
7 1303211957
8 1012880068
9 1113933789
10 1002529000
11 1139156391
12 1080784472
13 1121350183
14 1010485494
15 1111055105
16 1000603246
17 1101719337

List of values

[1080548820, 1121114531, 1010249842, 1115859543, 1064928464, 1105018975, 1026605496, 1303211957, 1012880068, 1113933789, 1002529000, 1139156391, 1080784472, 1121350183, 1010485494, 1111055105, 1000603246, 1101719337]