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.

A381057 Array read by diagonals downwards: A(n,k) for n>=2 and k>=0 is the number of (n,k)-polyominoes counting as distinct different formations of transparent squares.

Table of values

n a(n)
2 1
3 2
4 2
5 3
6 5
7 5
8 6
9 17
10 24
11 12
12 10
13 41
14 101
15 89
16 35
17 20
18 106
19 353
20 535
21 382
22 108
23 36
24 243
25 1091
26 2355
27 2769
28 1566
29 369
30 72
31 567
32 3095
33 8937
34 14841
35 13739
36 6569
37 1285
38 136
39 1259
40 8209
41 29744
42 65651
43 86322
44 66499
45 27205
46 4655
47 272
48 2806
49 20804
50 90914
51 252277
52 439879
53 479343
54 314445
55 112886
56 17073
57 528
58 6113
59 50801
60 259078
61 872526

List of values

[1, 2, 2, 3, 5, 5, 6, 17, 24, 12, 10, 41, 101, 89, 35, 20, 106, 353, 535, 382, 108, 36, 243, 1091, 2355, 2769, 1566, 369, 72, 567, 3095, 8937, 14841, 13739, 6569, 1285, 136, 1259, 8209, 29744, 65651, 86322, 66499, 27205, 4655, 272, 2806, 20804, 90914, 252277, 439879, 479343, 314445, 112886, 17073, 528, 6113, 50801, 259078, 872526]