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.

A385862 Number of n X m yesnograms that can be solved uniquely, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 4
8 4
9 1
10 1
11 8
12 14
13 8
14 1
15 1
16 16
17 52
18 52
19 16
20 1
21 1
22 32
23 210
24 368
25 210
26 32
27 1
28 1
29 64
30 816
31 2992
32 2992
33 816
34 64
35 1
36 1
37 128
38 3206
39 23058
40 49578
41 23058
42 3206
43 128
44 1
45 1
46 256
47 12536
48 179576
49 775204
50 775204
51 179576
52 12536
53 256
54 1
55 1
56 512
57 48962
58 1388978
59 12129616
60 24177516
61 12129616
62 1388978
63 48962
64 512
65 1

List of values

[1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 8, 14, 8, 1, 1, 16, 52, 52, 16, 1, 1, 32, 210, 368, 210, 32, 1, 1, 64, 816, 2992, 2992, 816, 64, 1, 1, 128, 3206, 23058, 49578, 23058, 3206, 128, 1, 1, 256, 12536, 179576, 775204, 775204, 179576, 12536, 256, 1, 1, 512, 48962, 1388978, 12129616, 24177516, 12129616, 1388978, 48962, 512, 1]