This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241163 Maximal girth of a connected transitive trivalent (or cubic) graph with 2n nodes. 1
 3, 4, 4, 5, 4, 6, 6, 6, 6, 6, 6, 7, 7, 8, 6, 7, 7, 6, 8, 8, 6, 6, 8, 8, 8, 8, 8, 8, 9, 6, 8, 8, 8, 8, 8, 8, 6, 8, 10, 8, 8, 6, 6, 10, 6, 6, 10, 7, 10, 9, 8, 8, 10, 10, 10, 8, 8, 6, 10, 8, 6, 10, 10, 8, 10, 6, 8, 8, 10, 6, 10, 8, 8, 8, 6, 8, 10, 6, 10, 12, 8, 6, 12, 8, 6, 8, 10, 8, 10, 12, 6, 8, 6, 8, 12, 8, 10, 8, 10, 8, 12, 6, 10, 10, 8, 6, 12, 8, 10, 8, 12, 8, 10, 8, 8, 12, 6, 8, 12, 8, 8, 8, 6, 11, 10, 6, 12, 8, 10 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS N. J. A. Sloane, Table of n, a(n) for n = 2..640, based on the work of Primož Potočnik, Pablo Spiga and Gabriel Verret Primož Potočnik, Pablo Spiga and Gabriel Verret, A census of small connected cubic vertex-transitive graphs (See the sub-page Table.html) CROSSREFS Cf. A032355 Sequence in context: A028949 A201006 A107574 * A053405 A133196 A179841 Adjacent sequences:  A241160 A241161 A241162 * A241164 A241165 A241166 KEYWORD nonn AUTHOR N. J. A. Sloane, Apr 19 2014 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.

Last modified March 26 00:29 EDT 2019. Contains 321479 sequences. (Running on oeis4.)