The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326347 Number of unordered pairs of 4-colorings of an n-cycle that differ in the coloring of exactly one vertex. 2
36, 240, 780, 2952, 10164, 35040, 118044, 393720, 1299012, 4251600, 13817388, 44641128, 143488980, 459165120, 1463588412, 4649045976, 14721978468, 46490458800, 146444944716, 460255541064, 1443528741876, 4518872583840, 14121476823900, 44059007691192 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
LINKS
Eric Weisstein's World of Mathematics, Cycle Graph
FORMULA
a(n) = n*(3*A218034(n-2) + A218034(n-1)).
a(n) = 6*n*(3^(n-2) + (-1)^n).
a(n) = 12*n*A046717(n-2).
a(n) = 4*a(n-1) + 2*a(n-2) - 12*a(n-3) - 9*a(n-4) for n > 6.
G.f.: 12*x^3*(3 + 8*x - 21*x^2 - 18*x^3)/((1 + x)^2*(1 - 3*x)^2).
PROG
(PARI) a(n) = 6*n*(3^(n-2) + (-1)^n);
CROSSREFS
Sequence in context: A297656 A268794 A159921 * A129149 A223558 A074363
KEYWORD
nonn,easy
AUTHOR
Andrew Howroyd, Sep 11 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 22:04 EDT 2024. Contains 373102 sequences. (Running on oeis4.)