cp's OEIS Frontend

A382195 a(n) is the code (in the encoding given by A076184) of the square of the graph with code A076184(n).

%I A382195 #12 Mar 21 2025 11:14:02
%S A382195 0,1,7,7,63,12,31,63,63,63,63,1023,116,255,1023,239,511,511,1023,116,
%T A382195 255,511,1023,1023,1023,1023,1023,1023,1023,1023,1023,1023,1023,1023,
%U A382195 32767,1972,4095,32767,3873,7903,3951,8191,8191,32767,3873,7903,8191,32767
%N A382195 a(n) is the code (in the encoding given by A076184) of the square of the graph with code A076184(n).
%H A382195 FindStat - The combinatorial statistics database, <a href="https://www.findstat.org/Mp00147">The square of a graph</a>.
%H A382195 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphSquare.html">Graph Square</a>.
%H A382195 Wikipedia, <a href="https://en.wikipedia.org/wiki/Graph_power">Graph power</a>.
%e A382195 As an irregular triangle, where the first row contains 1 term and row n >= 2 contains A002494(n) terms:
%e A382195   0;
%e A382195   1;
%e A382195   7, 7;
%e A382195   63, 12, 31, 63, 63, 63, 63;
%e A382195   ...
%e A382195 For n = 7, A076184(7) = 13 is the code for the path graph on 4 vertices. The square of that graph is the diamond graph, whose code is 31 = a(7).
%Y A382195 Cf. A002494, A076184, A382194.
%K A382195 nonn,tabf,base
%O A382195 1,3
%A A382195 _Pontus von Brömssen_, Mar 18 2025