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

0, 1, 7, 7, 63, 12, 31, 63, 63, 63, 63, 1023, 116, 255, 1023, 239, 511, 511, 1023, 116, 255, 511, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 1023, 32767, 1972, 4095, 32767, 3873, 7903, 3951, 8191, 8191, 32767, 3873, 7903, 8191, 32767

Offset

1,3

Links

Table of n, a(n) for n=1..48.

FindStat - The combinatorial statistics database, The square of a graph.

Eric Weisstein's World of Mathematics, Graph Square.

Wikipedia, Graph power.

Example

As an irregular triangle, where the first row contains 1 term and row n >= 2 contains A002494(n) terms:
  0;
  1;
  7, 7;
  63, 12, 31, 63, 63, 63, 63;
  ...
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).

Crossrefs

Cf. A002494, A076184, A382194.

Sequence in context: A153272 A117860 A367456 * A360367 A274908 A009201

Adjacent sequences: A382192 A382193 A382194 * A382196 A382197 A382198

Keyword

nonn,tabf,base

Author

Pontus von Brömssen, Mar 18 2025

Status

approved