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!)
A005645 Number of sensed 3-connected planar maps with n edges.
(Formerly M0599)
3
1, 0, 1, 2, 3, 4, 15, 32, 89, 266, 797, 2496, 8012, 26028, 85888, 286608, 965216, 3278776, 11221548, 38665192, 134050521, 467382224, 1638080277, 5768886048, 20407622631, 72494277840, 258527335373, 925322077852, 3323258053528, 11973883092034, 43273374700200, 156836969693756, 569967330200576, 2076647113454878, 7584534277720818, 27764845224462192, 101862027752012402, 374484866509396780, 1379489908513460150 (list; graph; refs; listen; history; text; internal format)
OFFSET
6,4
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. R. S. Walsh, Counting nonisomorphic three-connected planar maps, J. Combin. Theory Ser. B 32 (1982), no. 1, 33-44.
FORMULA
a(n) = Sum_{k=4..n-2} A239893(k, n+2-k). - Andrew Howroyd, Mar 27 2021
CROSSREFS
Cf. A002840 (unsensed), A239893.
Sequence in context: A270929 A103096 A295757 * A362639 A348628 A281586
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms and b-file added by N. J. A. Sloane, May 08 2012
STATUS
approved

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 May 6 12:40 EDT 2024. Contains 372293 sequences. (Running on oeis4.)