A002464 - cp's OEIS frontend

A002464 Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions.

n	a(n)
0	1
1	1
2	0
3	0
4	2
5	14
6	90
7	646
8	5242
9	47622
10	479306
11	5296790
12	63779034
13	831283558
14	11661506218
15	175203184374
16	2806878055610
17	47767457130566
18	860568917787402
19	16362838542699862
20	327460573946510746
21	6880329406055690790
22	151436547414562736234
23	3484423186862152966838

[1, 1, 0, 0, 2, 14, 90, 646, 5242, 47622, 479306, 5296790, 63779034, 831283558, 11661506218, 175203184374, 2806878055610, 47767457130566, 860568917787402, 16362838542699862, 327460573946510746, 6880329406055690790, 151436547414562736234, 3484423186862152966838]

cp's OEIS Frontend

A002464 Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions.

Table of values

List of values