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.

A056496 Number of primitive (period n) periodic palindromes using a maximum of five different symbols.

Original entry on oeis.org

5, 10, 20, 60, 120, 340, 620, 1800, 3100, 9240, 15620, 46440, 78120, 233740, 390480, 1170000, 1953120, 5855900, 9765620, 29287440, 48827480, 146468740, 244140620, 732373200, 1220703000, 3662031240
Offset: 1

Views

Author

Keywords

Comments

Number of aperiodic necklaces with five colors that are the same when turned over and hence have reflectional symmetry but no rotational symmetry. - Herbert Kociemba, Nov 29 2016

Examples

			For example, aaabbb is not a (finite) palindrome but it is a periodic palindrome.
		

References

  • 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]

Crossrefs

Column 5 of A284856.
Cf. A056461.

Programs

  • Mathematica
    mx=40;gf[x_,k_]:=Sum[ MoebiusMu[n]*Sum[Binomial[k,i]x^(n i),{i,0,2}]/( 1-k x^(2n)),{n,mx}]; CoefficientList[Series[gf[x,5],{x,0,mx}],x] (* Herbert Kociemba, Nov 29 2016 *)

Formula

a(n) = Sum_{d|n} mu(d)*A056487(n/d).
From Herbert Kociemba, Nov 29 2016: (Start)
More generally, gf(k) is the g.f. for the number of necklaces with reflectional symmetry but no rotational symmetry and beads of k colors.
gf(k): Sum_{n>=1} mu(n)*Sum_{i=0..2} binomial(k,i)x^(n*i)/(1-k*x^(2*n)). (End)