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!)
A007183 Maximal splittance of a planar graph with n nodes.
(Formerly M0550)
1

%I M0550 #43 Mar 03 2024 04:01:55

%S 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,

%T 54,57,60,63,66,69,72,75,78,81,84,87,90,93,96,99,102,105,108,111,114,

%U 117,120,123,126,129,132,135,138,141,144,147,150,153,156,159,162

%N Maximal splittance of a planar graph with n nodes.

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

%H Stefano Spezia, <a href="/A007183/b007183.txt">Table of n, a(n) for n = 0..10000</a> (missing a(9991) inserted by Sidney Cadot, Jan 03 2023)

%H P. L. Hammer and B. Simeone, <a href="https://doi.org/10.1007/BF02579333">The splittance of a graph</a>, Combinatorica, 1 (1981), 275-284.

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

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

%F From _Stefano Spezia_, Jul 12 2022: (Start)

%F 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.

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

%t 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 *)

%K nonn,nice,easy

%O 0,5

%A _N. J. A. Sloane_, _Simon Plouffe_

%E Title improved by _Sean A. Irvine_, Nov 12 2017

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 March 29 02:16 EDT 2024. Contains 371264 sequences. (Running on oeis4.)