A201471 Maximal diameter of a connected n-gamma_t-vertex-critical graph.

3, 4, 6, 7, 9, 11, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157

Offset

3,1

References

Henning, Michael A., A survey of selected recent results on total domination in graphs. Discrete Math. 309 (2009), no. 1, 32-63.

Links

Colin Barker, Table of n, a(n) for n = 3..1000

Index entries for linear recurrences with constant coefficients, signature (2,-1).

Formula

For n >= 9, a(n) = 2n-3.

G.f.: x^3*(3 - 2*x + x^2 - x^3 + x^4 + 2*x^6 - 2*x^7) / (1 - x)^2. - Colin Barker, Dec 25 2019

Mathematica

LinearRecurrence[{2, -1}, {3, 4, 6, 7, 9, 11, 15, 17}, 80] (* Harvey P. Dale, Nov 07 2021 *)

Prog

(PARI) Vec(x^3*(3 - 2*x + x^2 - x^3 + x^4 + 2*x^6 - 2*x^7) / (1 - x)^2 + O(x^70)) \\ Colin Barker, Dec 25 2019

Crossrefs

Sequence in context: A301766 A229173 A066499 * A338387 A360799 A136110

Adjacent sequences: A201468 A201469 A201470 * A201472 A201473 A201474

Keyword

nonn,easy

Author

N. J. A. Sloane, Dec 01 2011

Status

approved