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 A056353 #14 Oct 25 2019 16:55:54
%S A056353 1,1,2,3,6,9,22,40,100,225,582,1464,3960,10585,29252,80819,226530,
%T A056353 636321,1800562,5107480,14548946,41538916,118929384,341187048,
%U A056353 980842804,2824561089,8147557742,23536592235,68087343148,197216119545,571924754778,1660419530056,4825588205920
%N A056353 Number of bracelet structures using a maximum of three different colored beads.
%C A056353 Turning over will not create a new bracelet. Permuting the colors of the beads will not change the structure.
%D A056353 M. R. Nester (1999). Mathematical investigations of some plant interaction designs. PhD Thesis. University of Queensland, Brisbane, Australia. [See A056391 for pdf file of Chap. 2]
%H A056353 Andrew Howroyd, <a href="/A056353/b056353.txt">Table of n, a(n) for n = 0..200</a>
%H A056353 R. M. Thompson and R. T. Downs, <a href="http://www.geo.arizona.edu/xtal//group/pdf/acB57766.pdf">Systematic generation of all nonequivalent closest packed stacking sequences of length N using group theory</a>, Acta Cryst. B57 (2001), 766-771; B58 (2002), 153.
%F A056353 Use de Bruijn's generalization of Polya's enumeration theorem as discussed in reference.
%F A056353 a(n) = Sum_{k=1..3} A152176(n, k) for n > 0. - _Andrew Howroyd_, Oct 25 2019
%Y A056353 Cf. A002076, A000011, A027671, A114438, A152176.
%K A056353 nonn
%O A056353 0,3
%A A056353 _Marks R. Nester_
%E A056353 a(0)=1 prepended and terms a(28) and beyond from _Andrew Howroyd_, Oct 25 2019