cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Pontus von Brömssen, Mar 18 2025

Keywords

Examples

			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