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.

A075154 a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 910
11 0
12 912
13 11713
14 6314
15 915
16 3616
17 15317
18 918
19 17119
20 9920
21 18921
22 9922
23 82823
24 19824
25 9925
26 46826
27 18927
28 18928
29 78329
30 99930
31 585931
32 388832
33 1098933
34 198934
35 289835
36 99936
37 99937
38 478838
39 198939
40 1999840

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 910, 0, 912, 11713, 6314, 915, 3616, 15317, 918, 17119, 9920, 18921, 9922, 82823, 19824, 9925, 46826, 18927, 18928, 78329, 99930, 585931, 388832, 1098933, 198934, 289835, 99936, 99937, 478838, 198939, 1999840]