TU Darmstadt / ULB / TUbiblio

A255436: Number of distinct, connected, order-n subgraphs of the infinite knight's graph

Miller, Tristan (2018):
A255436: Number of distinct, connected, order-n subgraphs of the infinite knight's graph.
In: The On-line Encyclopedia of Integer Sequences, [Online-Edition: https://oeis.org/A255436],
[Book Section]

Official URL: https://oeis.org/A255436

Abstract

More concretely, a(n) is the number of distinct graphs where the vertices can be mapped to different squares of a chessboard such that the connected pairs of vertices are a knight's move apart.

Item Type: Book Section
Erschienen: 2018
Creators: Miller, Tristan
Title: A255436: Number of distinct, connected, order-n subgraphs of the infinite knight's graph
Language: English
Abstract:

More concretely, a(n) is the number of distinct graphs where the vertices can be mapped to different squares of a chessboard such that the connected pairs of vertices are a knight's move apart.

Title of Book: The On-line Encyclopedia of Integer Sequences
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Ubiquitous Knowledge Processing
Date Deposited: 23 Aug 2018 10:51
Official URL: https://oeis.org/A255436
Identification Number: A255436
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item