This site is supported by donations to The OEIS Foundation.
Crystal ball sequences
From OeisWiki
This is the latest
This article page is a stub, please help by expanding it.
A crystal ball sequence is the sequence of partial sums of the coordination sequence of an infinite vertex-transitive graph as defined in Conway & Sloane 1997.[1] That is, the n-th term gives the number of vertices which are at most n edge traversals away from a given vertex (which can be any vertex, since the graph is vertex-transitive).
See also
References
- ↑ J. H. Conway and N. J. A. Sloane, Low-dimensional lattices. VII. Coordination sequences, Proceedings of the Royal Society 453:1966 (1997), pp. 2369-2389. DOI 10.1.1.39.9899
Cite this page as
Charles R Greathouse IV, Crystal ball sequences. — From the On-Line Encyclopedia of Integer Sequences® (OEIS®) wiki. (Available at https://oeis.org/wiki/Crystal_ball_sequences)
