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.

A052490 Numbers n with only one nonzero solution to "numbers that are n times sum of their digits".

Table of values

n a(n)
1 2
2 3
3 5
4 6
5 8
6 9
7 11
8 12
9 14
10 15
11 17
12 18
13 20
14 21
15 23
16 24
17 29
18 30
19 32
20 33
21 35
22 39
23 41
24 42
25 44
26 45
27 50
28 51
29 53
30 54
31 56
32 57
33 59
34 60
35 66
36 68
37 69
38 71
39 72
40 74
41 77
42 78
43 80
44 81
45 83
46 86
47 87
48 89
49 90
50 92
51 93
52 96
53 98
54 99
55 101
56 102
57 104
58 105
59 108
60 110
61 111
62 113
63 114
64 117
65 119
66 120
67 122

List of values

[2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 17, 18, 20, 21, 23, 24, 29, 30, 32, 33, 35, 39, 41, 42, 44, 45, 50, 51, 53, 54, 56, 57, 59, 60, 66, 68, 69, 71, 72, 74, 77, 78, 80, 81, 83, 86, 87, 89, 90, 92, 93, 96, 98, 99, 101, 102, 104, 105, 108, 110, 111, 113, 114, 117, 119, 120, 122]