A211882 Number of integral circulant graphs with perfect state transfer on 4*n vertices.

2, 2, 4, 4, 4, 16, 4, 8, 8, 16, 4, 256, 4, 16, 16, 16, 4, 512, 4, 256, 16, 16, 4, 4096, 8, 16, 16, 256, 4, 65536, 4, 32, 16, 16, 16, 262144, 4, 16, 16, 4096, 4, 65536, 4, 256, 64, 16, 4, 65536, 8, 512, 16, 256, 4, 65536, 16, 4096, 16, 16, 4, 4294967296

Offset: 1

Author

Matthew C. Russell, Apr 25 2012

Keywords

• nonn

Examples

			For n=1 there are a(1)=2 graphs with perfect state transfer: C_4 and the disjoint union of two copies of K_2.
		

Links

• Fomin, Sergey; Zelevinsky, Andrei; The Laurent phenomenon, arXiv:math/0104241v1 [math.CO] (2001), Advances in Applied Mathematics 28 (2002), 119-144.