login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007183 Maximal splittance of a planar graph with n nodes.
(Formerly M0550)
0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

REFERENCES

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

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

LINKS

Table of n, a(n) for n=0..46.

FORMULA

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

CROSSREFS

Sequence in context: A064375 A037229 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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 14:51 EST 2020. Contains 338906 sequences. (Running on oeis4.)