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.

A371476 a(n) is the number of free polyominoes of size n with at least one solution to the One Up puzzle (see comments).

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 1
6 3
7 10
8 12
9 23
10 35
11 169
12 255
13 817
14 1883
15 4702
16 10489

List of values

[1, 0, 1, 1, 1, 3, 10, 12, 23, 35, 169, 255, 817, 1883, 4702, 10489]