|
%I #23 Feb 12 2021 12:13:19
%S 0,1,1155,759759,103786510,4767856260,107118740001,1465350136810,
%T 13956101513964,100946621623995,588405869207695,2882842751900001,
%U 12245455022841690,46164185630256694,157281327978056205,491245336843482180,1422828159652548376,3857444027819847045,9864873410828916699,23951146853875652515,55509091777214287590
%N Non-isomorphic proper colorings of the 4 X 4 grid graph using at most n colors under rotational and reflectional symmetries.
%D F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, 1973.
%H Marko Riedel et al., <a href="https://math.stackexchange.com/questions/2584928/">Tree graphs colorings</a>, Math StackExchange, December 2017.
%H Marko Riedel et al., <a href="https://math.stackexchange.com/questions/2977453/">3-colourings of a 3×3 table with one of 3 colors up to symmetries</a>, Math StackExchange, October 2018.
%F a(n) = (1/8)*n^16 - 3*n^15 + (69/2)*n^14 - (2015/8)*n^13 + (10437/8)*n^12 - (20307/4)*n^11 + 15333*n^10 - (292907/8)*n^9 + (557915/8)*n^8 - (848501/8)*n^7 + (1023195/8)*n^6 - (240539/2)*n^5 + (683997/8)*n^4 - (347485/8)*n^3 + (112831/8)*n^2 - (8807/4)*n.
%Y Cf. A002817, A321244, A321246.
%K nonn
%O 1,3
%A _Marko Riedel_, Nov 01 2018
|
