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.

A202272 Numbers n with k digits such that each sum of 1, 2, ..., k digits of n is a substring of n.

Table of values

n a(n)
1 0
2 1
3 2
4 3
5 4
6 5
7 6
8 7
9 8
10 9
11 10
12 20
13 30
14 40
15 50
16 60
17 70
18 80
19 90
20 100
21 109
22 200
23 300
24 400
25 500
26 600
27 700
28 800
29 910
30 1000
31 1009
32 1090
33 2000
34 3000
35 4000
36 5000
37 6000
38 7000
39 8000
40 9000
41 9010
42 9100
43 10000
44 10009
45 10090
46 10900
47 20000
48 30000
49 40000
50 50000
51 60000
52 70000

List of values

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 109, 200, 300, 400, 500, 600, 700, 800, 910, 1000, 1009, 1090, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, 9010, 9100, 10000, 10009, 10090, 10900, 20000, 30000, 40000, 50000, 60000, 70000]