A308626 -id:A308626 - cp's OEIS frontend

A308625 Van Eck sequence in 2-dimensional hexagonal space.

0, 0, 1, 0, 1, 2, 0, 1, 2, 3, 0, 2, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Jacek Sandomierz, Jun 11 2019

Fill a board made from hexagonal cells with numbers using the following rules:
- write a 0 in the starting cell;
- if the number just written had not previously been on the board then the next number is 0;
- otherwise, the next number is the distance from its closest occurrence, counting cells you need to pass through to reach it.
              ____            ____
             /      \          /      \
            /        \        /        \
     ____/          \____/          \____
    /      \          /      \          /      \
   /        \        /        \        /        \
  /          \____/     2    \____/          \
  \          /      \  .     . /      \          /
   \        /       .\        / .      \        /
    \____/     1    \____/     3    \____/
    /      \     .    /      \        . /      \
   /        \    .   /        \        / .      \
  /     1    \_.__/     0    \____/     0    \
  \     .    /   .  \     .  . /      \     .    /
   \    .   /    .   \    .   / .      \    .   /
    \_.__/     0    \_.__/     1    \_.__/
    /   .  \     .    /   ^  \     .    /   .  \
   /    .   \    .   /    |   \    .   /    .   \
  /     1    \_.__/     0    \_.__/     2    \
  \     .    /   .  \   START  /   .  \     .    /
   \    .   /    .   \        /    .   \    .   /
    \_.__/     2    \____/     0    \_.__/
    /   .  \        . /      \  .       /   .  \
   /    .   \        / .     .\        /    .   \
  /     1    \____/     1    \____/     3    \
  \        . /      \          /      \  .       /
   \        / .      \        /       .\        /
    \____/     1    \____/     3    \____/
    /      \        . /      \  .       /      \
   /        \        / .     .\        /        \
  /          \____/     1    \____/          \
  \          /      \          /      \          /
   \        /        \        /        \        /
    \____/          \____/          \____/
.
a(n) = 1 for all n > 15, because the previous 1 will always be adjacent to another 1. - Charlie Neder, Jun 11 2019

Index entries for linear recurrences with constant coefficients, signature (1).

Cf. A181391, A308626.

G.f.: x^3*(1 - x + x^2 + x^3 - 2*x^4 + x^5 + x^6 + x^7 - 3*x^8 + 2*x^9 + x^10 - 2*x^12)/(1 - x). - Elmo R. Oliveira, Aug 03 2024

Extended by Charlie Neder, Jun 13 2019

A308628 A Van Eck-type sequence on the triangular lattice.

Original entry on oeis.org

0, 0, 1, 0, 2, 0, 1, 4, 0, 2, 3, 0, 2, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Charlie Neder, Jun 11 2019

For a given lattice, the Van Eck sequence over that lattice is the unique sequence of nonnegative integers such that, if all equal terms are connected by "bridges" that travel between adjacent faces, then each term is the length of the bridge connecting the previous term to a term with lower index, or 0 if no such bridge exists. Generally, the Van Eck sequence of a given lattice is not unique since it depends on the path that the sequence takes through the lattice. This sequence uses a spiral, as in A308625 and A308626, and appears as follows, starting at the cell in parentheses facing upward and traveling clockwise:
   --------------------------------
   \   / \   / \ 3 / \ 1 / \   / \
   .\ /   \ / 3 \ / 1 \ / 1 \ /   \
   --------------------------------
   ./ \   / \ 2 / \ 1 / \ 1 / \   /
   /   \ / 0 \ / 0 \ / 0 \ / 1 \ /
   --------------------------------
   \   / \ 3 / \(0)/ \ 2 / \ 1 / \
   .\ /   \ / 2 \ / 0 \ / 1 \ /   \
   --------------------------------
   ./ \   / \ 0 / \ 1 / \ 1 / \   /
   /   \ /   \ / 4 \ / 1 \ /   \ /
   --------------------------------
Note: This sequence uses the definition that two cells are adjacent if they share an edge. Allowing vertex adjacency makes a very boring sequence: 0, 0, 1, and 0, followed by an infinite string of 1's.
a(n) = 1 for all n >= 17, since the previous 1 will always be adjacent to another 1. The Van Eck-type sequences for the square and hexagonal lattices end similarly.

			a(7) = 1, and the only other 1 to appear so far is 4 cells away (not 2, since we only consider edge adjacency), so a(8) = 4.

Index entries for linear recurrences with constant coefficients, signature (1).

Cf. A181391, A308625, and A308626 for Van Eck-type sequences over the 1D "lattice" and the 2D hexagonal and square lattices, respectively.

G.f.: x^3*(1 - x + 2*x^2 - 2*x^3 + x^4 + 3*x^5 - 4*x^6 + 2*x^7 + x^8 - 3*x^9 + 2*x^10 + x^11 - 2*x^13)/(1 - x). - Elmo R. Oliveira, Aug 03 2024

cp's OEIS Frontend

A308625 Van Eck sequence in 2-dimensional hexagonal space.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions