OFFSET
3,1
COMMENTS
The sunlet graph S_n is obtained from the cycle C_n by attaching one pendant vertex to each cycle vertex. Thus S_n has 2n vertices.
This is the rotation-only version. Reflected colorings are not identified.
Equivalently, runs of equal colors around the cycle have length at most 2. A pendant vertex attached to a cycle vertex in a run of length 2 is forced to have the opposite color, a pendant vertex attached to an isolated cycle vertex is free.
LINKS
Robert P. P. McKone, The rotation-class representative Sunlets a(3) to a(11).
Robert P. P. McKone, a(3) = 4 Sunlet Graphs.
Robert P. P. McKone, a(4) = 11 Sunlet Graphs.
Robert P. P. McKone, a(5) = 16 Sunlet Graphs
Robert P. P. McKone, a(6) = 38 Sunlet Graphs.
Robert P. P. McKone, a(7) = 68 Sunlet Graphs.
Robert P. P. McKone, a(8) = 151 Sunlet Graphs.
Robert P. P. McKone, a(9) = 312 Sunlet Graphs.
Robert P. P. McKone, a(10) = 684 Sunlet Graphs.
Robert P. P. McKone, a(11) = 1476 Sunlet Graphs.
Eric Weisstein's World of Mathematics, Sunlet Graph
FORMULA
a(n) = (1/n) * Sum_{d|n} (phi(n/d) * ((1+sqrt(2))^d + (1-sqrt(2))^d + 2*(-1)^d)).
EXAMPLE
Binary sunlet colorings up to rotation. No monochromatic component has size 3 or more. Blocks are rl around the cycle, ring color, then pendant color.
The a(3) = 4 rotation-class representative sunlets, {00,10,10}, {01,01,10}, {01,10,10}, {01,01,11}
MATHEMATICA
a[n_] := Simplify[Sum[EulerPhi[n/d] ((1 + Sqrt[2])^d + (1 - Sqrt[2])^d + 2 (-1)^d), {d, Divisors[n]}]/n];
Table[a[n], {n, 3, 33}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert P. P. McKone, Jun 02 2026
STATUS
approved
