A089975 - cp's OEIS frontend

A089975 Array read by ascending antidiagonals: T(n,k) is the number of n-letter words from a k-letter alphabet such that no letter appears more than twice.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	1
8	2
9	1
10	0
11	0
12	4
13	3
14	1
15	0
16	0
17	6
18	9
19	4
20	1
21	0
22	0
23	6
24	24
25	16
26	5
27	1
28	0
29	0
30	0
31	54
32	60
33	25
34	6
35	1
36	0
37	0
38	0
39	90
40	204
41	120
42	36
43	7
44	1
45	0
46	0
47	0
48	90
49	600
50	540
51	210
52	49
53	8
54	1
55	0
56	0
57	0
58	0
59	1440
60	2220
61	1170
62	336
63	64
64	9
65	1
66	0
67	0
68	0
69	0
70	2520
71	8100
72	6120
73	2226
74	504
75	81
76	10
77	1

[1, 0, 1, 0, 1, 1, 0, 1, 2, 1, 0, 0, 4, 3, 1, 0, 0, 6, 9, 4, 1, 0, 0, 6, 24, 16, 5, 1, 0, 0, 0, 54, 60, 25, 6, 1, 0, 0, 0, 90, 204, 120, 36, 7, 1, 0, 0, 0, 90, 600, 540, 210, 49, 8, 1, 0, 0, 0, 0, 1440, 2220, 1170, 336, 64, 9, 1, 0, 0, 0, 0, 2520, 8100, 6120, 2226, 504, 81, 10, 1]

cp's OEIS Frontend

A089975 Array read by ascending antidiagonals: T(n,k) is the number of n-letter words from a k-letter alphabet such that no letter appears more than twice.

Table of values

List of values