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.

A244510 a(0)=0; for n>0, choose a(n) to be the smallest number > a(n-1) such that the condition a(n) > Sum_{k=0..n} digsum(a(k)) holds.

Table of values

n a(n)
0 0
1 10
2 11
3 12
4 13
5 20
6 21
7 22
8 30
9 31
10 32
11 40
12 41
13 50
14 60
15 61
16 70
17 80
18 90
19 100
20 101
21 102
22 103
23 104
24 105
25 110
26 111
27 120
28 121
29 122
30 130
31 131
32 140
33 141
34 150
35 160
36 170
37 171
38 180
39 190
40 200
41 201
42 202
43 210
44 211
45 212
46 220
47 221
48 230
49 231
50 240
51 250
52 260
53 261
54 270
55 280

List of values

[0, 10, 11, 12, 13, 20, 21, 22, 30, 31, 32, 40, 41, 50, 60, 61, 70, 80, 90, 100, 101, 102, 103, 104, 105, 110, 111, 120, 121, 122, 130, 131, 140, 141, 150, 160, 170, 171, 180, 190, 200, 201, 202, 210, 211, 212, 220, 221, 230, 231, 240, 250, 260, 261, 270, 280]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.