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.

A208601 Number of 7-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero.

This page as a plain text file.
%I A208601 #11 Mar 18 2018 17:29:06
%S A208601 57,1163,8671,39019,129823,353333,833253,1764925,3438877,6267735,
%T A208601 10816499,17836183,28300819,43447825,64821737,94321305,134249953,
%U A208601 187369603,256957863,346868579,461595751,606340813,787083277,1010654741
%N A208601 Number of 7-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero.
%C A208601 Row 7 of A208597.
%H A208601 R. H. Hardin, <a href="/A208601/b208601.txt">Table of n, a(n) for n = 1..210</a>
%F A208601 Empirical: a(n) = (841/180)*n^6 + (841/60)*n^5 + (325/18)*n^4 + (51/4)*n^3 + (949/180)*n^2 + (37/30)*n + 1.
%F A208601 Conjectures from _Colin Barker_, Mar 07 2018: (Start)
%F A208601 G.f.: x*(57 + 764*x + 1727*x^2 + 750*x^3 + 71*x^4 - 6*x^5 + x^6) / (1 - x)^7.
%F A208601 a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7) for n>7.
%F A208601 (End)
%e A208601 Some solutions for n=4:
%e A208601   -4  -2  -4  -4  -4  -3  -3  -4  -2  -4  -4  -3  -3  -3  -4  -4
%e A208601   -2  -2   3   1  -2   2   0  -4   2  -1   2  -1   0   1   2   2
%e A208601    3   1   2  -2   0   0  -1  -2   1   2  -2   0   1   0  -3  -4
%e A208601    1   2   1   0   3   2   2   1   1  -4   1   0   0   1   4   4
%e A208601   -2  -2  -1   2   3  -3  -1   1  -1   3  -3  -1  -2  -2  -4   1
%e A208601    1   1  -1  -1  -3   3   2   4   0   3   2   2   2   1   3  -2
%e A208601    3   2   0   4   3  -1   1   4  -1   1   4   3   2   2   2   3
%Y A208601 Cf. A208597.
%K A208601 nonn
%O A208601 1,1
%A A208601 _R. H. Hardin_, Feb 29 2012