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!)
A367967 a(n) = 3/4*(3^(n + 1) - 2*n - 4*n^2 - 3). 4
0, 0, 3, 27, 126, 462, 1521, 4761, 14556, 44028, 132543, 398199, 1195290, 3586698, 10761069, 32284341, 96854328, 290564472, 871695099, 2615087187, 7845263670, 23535793350, 70607382633, 211822150737, 635466455316, 1906399369332, 5719198111671, 17157594338991 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Number of 5-cycles in the n-Dorogovtsev-Goltsev-Mendes graph (using the convention that DGM(0) = P_2).
LINKS
Eric Weisstein's World of Mathematics, Dorogovtsev-Goltsev-Mendes Graph.
Eric Weisstein's World of Mathematics, Graph Cycle.
FORMULA
a(n) = 3/4*(3^(n + 1) - 2*n - 4*n^2 - 3).
a(n) = 6*a(n-1) - 12*a(n-2) + 10*a(n-3) - 3*a(n-4).
G.f.: 3*x^2*(1+3*x)/((-1+x)^3*(-1+3*x)).
MATHEMATICA
Table[3/4 (3^(n + 1) - 2 n - 4 n^2 - 3), {n, 0, 20}]
LinearRecurrence[{6, -12, 10, -3}, {0, 0, 3, 27}, 20]
CoefficientList[Series[3 x^2 (1 + 3 x)/((-1 + x)^3 (-1 + 3 x)), {x, 0, 20}], x]
CROSSREFS
Cf. A003462(n) (3-cycles), A290764(n-1) (4-cycles), A367968(n) (6-cycles).
Sequence in context: A241678 A063263 A204809 * A034200 A306442 A080424
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Dec 06 2023
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 May 2 04:48 EDT 2024. Contains 372178 sequences. (Running on oeis4.)