A007183 Maximal splittance of a planar graph with n nodes. (Formerly M0550)

0, 0, 0, 1, 2, 3, 4, 6, 8, 10, 12, 15, 16, 19, 22, 25, 27, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150, 153, 156, 159, 162

Offset

0,5

References

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Stefano Spezia, Table of n, a(n) for n = 0..10000 (missing a(9991) inserted by Sidney Cadot, Jan 03 2023)

P. L. Hammer and B. Simeone, The splittance of a graph, Combinatorica, 1 (1981), 275-284.

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

Formula

a(n) = 3*n - 27 for n >= 23 [from Hammer and Simeone]. - Sean A. Irvine, Nov 12 2017

From Stefano Spezia, Jul 12 2022: (Start)

G.f.: x^3*(1 + x^4 + x^8 - 2*x^9 + 2*x^10 - x^13 + x^14 - x^15 + x^16 - x^17 + x^18 - x^19 + x^20)/(1 - x)^2.

a(n) = 2*a(n-1) - a(n-2) for n >= 23. (End)

Mathematica

LinearRecurrence[{2, -1}, {0, 0, 0, 1, 2, 3, 4, 6, 8, 10, 12, 15, 16, 19, 22, 25, 27, 30, 32, 35, 37, 40, 42, 45}, 70] (* Harvey P. Dale, Mar 14 2023 *)

Crossrefs

Sequence in context: A037229 A351740 A230374 * A067783 A062418 A056168

Adjacent sequences: A007180 A007181 A007182 * A007184 A007185 A007186

Keyword

nonn,nice,easy

Author

N. J. A. Sloane, Simon Plouffe

Extensions

Title improved by Sean A. Irvine, Nov 12 2017

Status

approved