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.

A113736 Let prime(0) = 1 and f(i) = sum prime(d), where d ranges over all the decimal digits of i. The sequence specifies the smallest i such that f(i) = n.

Table of values

n a(n)
1 0
2 1
3 2
4 11
5 3
6 22
7 4
8 23
9 14
10 24
11 5
12 34
13 6
14 25
15 16
16 26
17 7
18 36
19 8
20 27
21 18
22 28
23 9
24 38
25 19
26 29
27 119
28 39
29 229
30 49
31 239
32 68
33 249
34 59
35 268
36 69
37 259
38 88
39 269
40 79
41 288
42 89
43 279
44 189
45 289
46 99
47 389
48 199
49 299
50 1199
51 399
52 2299
53 499
54 2399
55 689
56 2499
57 599
58 2689
59 699
60 2599
61 889
62 2699

List of values

[0, 1, 2, 11, 3, 22, 4, 23, 14, 24, 5, 34, 6, 25, 16, 26, 7, 36, 8, 27, 18, 28, 9, 38, 19, 29, 119, 39, 229, 49, 239, 68, 249, 59, 268, 69, 259, 88, 269, 79, 288, 89, 279, 189, 289, 99, 389, 199, 299, 1199, 399, 2299, 499, 2399, 689, 2499, 599, 2689, 699, 2599, 889, 2699]