a(n) is the number of maximal simple planar graphs of size n that admit a 2-queue layout.
A298361
a(n) is the number of maximal simple planar graphs of size n that admit a 2-queue layout.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =5a(5) =14a(6) =50a(7) =233a(8) =1249a(9) =7595a(10) =49566a(11) =339712a(12) =2405167a(13) =17412878a(14) =127855172a(15) =947394711
External references
- oeis: A298361