A327545 - cp's OEIS frontend

A327545 Triangle T(n,k) read by rows giving the number of zeroless polydivisible numbers in base n that have k distinct digits with 1 <= k <= n-1.

n	a(n)
2	1
3	4
4	0
5	5
6	2
7	2
8	10
9	14
10	8
11	0
12	7
13	14
14	20
15	2
16	2
17	26
18	39
19	84
20	60
21	27
22	0
23	11
24	47
25	108
26	95
27	63
28	3
29	3
30	20
31	101
32	233
33	369
34	289
35	79
36	17
37	0
38	19
39	86
40	306
41	475
42	714
43	409
44	146
45	1
46	1
47	32
48	201
49	979
50	2048
51	3581
52	3474
53	1925
54	449
55	51
56	0
57	17
58	114
59	507
60	1273
61	2224
62	2239
63	1074
64	230
65	35
66	0
67	0

[1, 4, 0, 5, 2, 2, 10, 14, 8, 0, 7, 14, 20, 2, 2, 26, 39, 84, 60, 27, 0, 11, 47, 108, 95, 63, 3, 3, 20, 101, 233, 369, 289, 79, 17, 0, 19, 86, 306, 475, 714, 409, 146, 1, 1, 32, 201, 979, 2048, 3581, 3474, 1925, 449, 51, 0, 17, 114, 507, 1273, 2224, 2239, 1074, 230, 35, 0, 0]

cp's OEIS Frontend

A327545 Triangle T(n,k) read by rows giving the number of zeroless polydivisible numbers in base n that have k distinct digits with 1 <= k <= n-1.

Table of values

List of values