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.

A055481 Numbers k for which there exists some m such that k = Sum_{i=1..1+floor(log_10(k))} binomial(m, d_i), where d_i is the i-th digit of k.

Table of values

n a(n)
1 1
2 10
3 18
4 21
5 72
6 100
7 101
8 111
9 134
10 231
11 246
12 505
13 682
14 1000
15 1010
16 1100
17 1122
18 2210
19 3103
20 4006
21 6008
22 10000
23 10001
24 10012
25 11101
26 15453
27 20101
28 29358
29 34698
30 56576
31 84304
32 100000
33 100010
34 100011
35 100100
36 100101
37 100110
38 100303
39 101000
40 101001
41 101010

List of values

[1, 10, 18, 21, 72, 100, 101, 111, 134, 231, 246, 505, 682, 1000, 1010, 1100, 1122, 2210, 3103, 4006, 6008, 10000, 10001, 10012, 11101, 15453, 20101, 29358, 34698, 56576, 84304, 100000, 100010, 100011, 100100, 100101, 100110, 100303, 101000, 101001, 101010]