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.

A380860 Triangle read by rows: T(n,m) (0<=m<=n) = number of positive n-digit numbers that have exactly m copies of a specific, previously selected positive base-10 digit among its digits.

Table of values

n a(n)
0 1
1 8
2 1
3 72
4 17
5 1
6 648
7 225
8 26
9 1
10 5832
11 2673
12 459
13 35
14 1
15 52488
16 29889
17 6804
18 774
19 44
20 1
21 472392
22 321489
23 91125
24 13770
25 1170
26 53
27 1
28 4251528
29 3365793
30 1141614
31 215055
32 24300
33 1647
34 62
35 1
36 38263752
37 34543665
38 13640319
39 3077109
40 433755
41 39123
42 2205
43 71
44 1
45 344373768
46 349156737
47 157306536
48 41334300
49 6980904
50 785862
51 58968
52 2844
53 80
54 1

List of values

[1, 8, 1, 72, 17, 1, 648, 225, 26, 1, 5832, 2673, 459, 35, 1, 52488, 29889, 6804, 774, 44, 1, 472392, 321489, 91125, 13770, 1170, 53, 1, 4251528, 3365793, 1141614, 215055, 24300, 1647, 62, 1, 38263752, 34543665, 13640319, 3077109, 433755, 39123, 2205, 71, 1, 344373768, 349156737, 157306536, 41334300, 6980904, 785862, 58968, 2844, 80, 1]