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.
%I A347258 #9 Sep 06 2023 13:25:25
%S A347258 1,0,3,1,10,5,40,23,169,107,741,499,3334,2349,15278,11141,71012,53198,
%T A347258 333756,255553,1582885,1234059,7563365,5986757,36367445,29161696,
%U A347258 175810059,142561190,853868747,699179932,4163891024
%N A347258 Number of fixed hexagonal polyominoes with n cells that have a horizontal axis of symmetry that is a diagonal of at least one of the n cells.
%C A347258 These are polyominoes of the Euclidean hexagonal regular tiling with Schläfli symbol {6,3}. This is one of three sequences needed to calculate the number of achiral polyominoes, A030225. The three sequences together contain exactly two copies of each achiral polyomino. This sequence can be calculated using a modification of Redelmeier's method; one chooses an original cell that is leftmost on and bisected by the axis of symmetry along a horizontal diagonal. Neighbors are added only if their centers are above the axis of symmetry or on the axis of symmetry to the right of the original cell. Cells not centered on the axis of symmetry are counted twice to include their reflections.
%H A347258 Robert A. Russell, <a href="/A347258/b347258.txt">Table of n, a(n) for n = 1..36</a>
%H A347258 D. H. Redelmeier, <a href="http://dx.doi.org/10.1016/0012-365X(81)90237-5">Counting polyominoes: yet another attack</a>, Discrete Math., 36 (1981), 191-203.
%Y A347258 Cf. A001207, A347257, A030225.
%K A347258 nonn
%O A347258 1,3
%A A347258 _Robert A. Russell_, Aug 24 2021