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!)
A176425 Number of connected planar graphs with at most n edges. 1
1, 2, 3, 6, 11, 23, 53, 132, 359, 1068, 3386, 11435, 40807, 152807, 597662, 2430734, 10237458, 44489603, 198831994, 911063459 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Partial sums of number of connected planar graphs with n edges (A046091).
LINKS
FORMULA
a(n) = Sum_{i=0..n} A046091(i).
CROSSREFS
Sequence in context: A000055 A217312 A006787 * A000992 A036648 A047750
KEYWORD
nonn,more
AUTHOR
Jonathan Vos Post, Apr 17 2010
EXTENSIONS
New name from Bartlomiej Pawlik, May 31 2022
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 March 29 04:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)