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.

A100800 Let f(n) = n + sum of the digits of n. If f(n) is multiple of n then a(n)= f(n) else a(n) = f(f(f(n)))... until one gets a multiple of n; a(n) = 0 if no such number exists.

Table of values

n a(n)
1 2
2 4
3 6
4 8
5 10
6 12
7 14
8 16
9 18
10 130
11 341
12 24
13 130
14 392
15 30
16 320
17 119
18 36
19 950
20 80
21 84
22 88
23 115
24 96
25 950
26 104
27 54
28 392
29 406
30 120
31 341
32 736
33 231
34 578
35 455
36 72
37 851
38 950
39 507
40 320
41 328
42 210
43 559
44 440
45 90
46 184
47 658
48 480
49 392
50 950
51 204
52 416
53 530
54 162
55 1430
56 2128
57 114

List of values

[2, 4, 6, 8, 10, 12, 14, 16, 18, 130, 341, 24, 130, 392, 30, 320, 119, 36, 950, 80, 84, 88, 115, 96, 950, 104, 54, 392, 406, 120, 341, 736, 231, 578, 455, 72, 851, 950, 507, 320, 328, 210, 559, 440, 90, 184, 658, 480, 392, 950, 204, 416, 530, 162, 1430, 2128, 114]