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 A296144 #6 Dec 24 2017 16:07:01
%S A296144 1,65,7780,1315825,244448316,48099214856,9844135755168,
%T A296144 2074189508907945,446932339677117580,98028351499011470680,
%U A296144 21813996435165740009568,4912693780465467348590056,1117598703447726807428962400,256444915320263078585645544000,59283681793041084579875939892480,13794224341895239072712767055117865
%N A296144 Number of configurations, excluding reflections and color swaps, of n beads each of four colors on a string.
%C A296144 Power Group Enumeration applies here.
%D A296144 E. Palmer and F. Harary, Graphical Enumeration, Academic Press, 1973.
%H A296144 Marko Riedel et al., <a href="https://math.stackexchange.com/questions/2530872/">Unique rows of pebbles</a>
%F A296144 With Z(S_{q,|m}) = [w^q] exp(Sum_{d|m} a_d w^d/d) and parameters n,k we have for nk even, (1/2) ((nk!)/k!/n!^k + (nk/2)! 2^(nk/2) [a_2^(nk/2)] Z(S_{k,|2})(Z_{n,|2}, a_2^n/n!) and for nk odd, (1/2) ((nk!)/k!/n!^k + ((nk-1)/2)! 2^((nk-1)/2) [a_1 a_2^((nk-1)/2)] Z(S_{k,|2})(Z_{n,|2}, a_2^n/n!). This sequence has k=4.
%Y A296144 Cf. A045723, A296143, A296145, A296146.
%K A296144 nonn
%O A296144 1,2
%A A296144 _Marko Riedel_, Dec 05 2017