For every positive integer $n$, we find a complete classification for planar graphs according to the collection of numbers of common neighbours for every $n$-tuple of distinct vertices. Our results expand the literature on planar graphical degree sequences, that have recently been the object of renewed attention. Here we completely settle the version with no multiplicities of the vast problem of planar graphical $n$-degree sequences.