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.

A138791 Least number k such that A070635(k) = n.

Table of values

n a(n)
0 1
1 11
2 16
3 15
4 14
5 38
6 34
7 29
8 28
9 19
10 49
11 76
12 68
13 98
14 269
15 79
16 458
17 397
18 379
19 299
20 779
21 769
22 689
23 898
24 799
25 3889
26 4898
27 5599
28 6698
29 7996
30 8798
31 9599
32 19888
33 16999
34 18899
35 67979
36 58898
37 39899
38 59998
39 49999
40 89789
41 189989
42 89998
43 98999
44 489898
45 298999

List of values

[1, 11, 16, 15, 14, 38, 34, 29, 28, 19, 49, 76, 68, 98, 269, 79, 458, 397, 379, 299, 779, 769, 689, 898, 799, 3889, 4898, 5599, 6698, 7996, 8798, 9599, 19888, 16999, 18899, 67979, 58898, 39899, 59998, 49999, 89789, 189989, 89998, 98999, 489898, 298999]