login
A382194
List of connected graphs that are squares, encoded as in A076184.
6
0, 1, 7, 31, 63, 239, 255, 511, 1023, 3455, 3887, 3951, 3967, 4095, 7679, 7903, 7935, 8191, 16350, 16351, 16383, 32767, 104063, 104447, 106287, 106351, 111587, 111599, 112511, 112623, 112639, 127791, 127855, 127871, 128879, 128895, 129023, 131071, 237567
OFFSET
1,3
COMMENTS
Intersection of A382193 and A382195.
LINKS
Pontus von Brömssen, Table of n, a(n) for n = 1..1580 (graphs on up to 9 vertices)
Eric Weisstein's World of Mathematics, Graph Square.
Wikipedia, Graph power.
EXAMPLE
As an irregular triangle, where row n >= 1 contains A382180(n) terms:
0;
1;
7;
31, 63;
239, 255, 511, 1023;
3455, 3887, 3951, 3967, 4095, 7679, 7903, 7935, 8191, 16350, 16351, 16383, 32767;
...
The diamond graph is connected and isomorphic to the square of the path graph on 4 vertices. The code of the diamond graph is 31, so 31 is a term.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
STATUS
approved