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.

Showing 1-3 of 3 results.

A378962 First differences of A378726.

Original entry on oeis.org

1, 1, 1, 5, 1, 1, 5, 1, 1, 5, 1, 1, 18, 1, 1, 5, 1, 1, 5, 1, 1, 18, 1, 1, 5, 1, 1, 5, 1, 1, 18, 1, 1, 5, 1, 1, 5, 1, 1, 58, 1, 1, 5, 1, 1, 5, 1, 1, 18, 1, 1, 5, 1, 1, 5, 1, 1, 18, 1, 1, 5, 1, 1, 5, 1, 1, 58, 1, 1, 5, 1, 1, 5, 1
Offset: 1

Views

Author

Tanya Khovanova and the MIT PRIMES STEP senior group, Dec 12 2024

Keywords

Comments

Sequence A378726(n) is defined to be the total number of fires on a rooted undirected infinite ternary tree with a self-loop at the root, when a chip-firing process starts with 3n chips at the root. The total number of fires for 3n, 3n-1, and 3n-2 chips are the same, so the sequence is defined for one of these three values to remove duplicates.
The corresponding sequence for binary trees is A376132; its distinct values are Eulerian numbers A000295.
The distinct values of this sequence form sequence A000340.

Examples

			The total number of fires when starting with 12 chips at the root is 3, and the total number of fires when starting with 15 chips at the root is 8. This means that a(4) = 5.

Links

  • Dillan Agrawal, Selena Ge, Jate Greene, Tanya Khovanova, Dohun Kim, Rajarshi Mandal, Tanish Parida, Anirudh Pulugurtha, Gordon Redwine, Soham Samanta, and Albert Xu, Chip-Firing on Infinite k-ary Trees, arXiv:2501.06675 [math.CO], 2025. See p. 17.
  • Wikipedia, Chip-firing game.

Crossrefs

Cf. A000295, A000340, A376132, A378724, A378726.

Programs

  • Python
    import math
def F(N, k):
    n = int(math.log(N * (k - 1) + 1, k))
    a = [0] * (n + 1)
    num = N - ((k ** n) - 1)/(k - 1)
    for i in range(n, -1, -1):
        if k ** i <= num:
            a[i] = int(num/(k ** i))
            num %= (k ** i)
    res = 0
    for j in range(1, n):
        x = int((j * (k ** (j + 1)) - (j + 1) * (k ** j) + 1)/((k - 1) ** 2))
        res += x * (a[j] + 1)
    return res
s = ""
for N in range(1, 200):
    s += str(int(F(3 * N + 3, 3) - F(3 * N, 3)))
    s += ", "
print(s)

Formula

a(n) = A000340(A378724(n+1)-A378724(n)-1).

A378724 The number of root fires on a rooted undirected infinite ternary tree with a self-loop at the root, when the chip-firing process starts with 3n chips at the root.

Original entry on oeis.org

0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 18, 19, 20, 22, 23, 24, 26, 27, 28, 31, 32, 33, 35, 36, 37, 39, 40, 41, 44, 45, 46, 48, 49, 50, 52, 53, 54, 58, 59, 60, 62, 63, 64, 66, 67, 68, 71, 72, 73, 75, 76, 77, 79, 80, 81, 84, 85, 86, 88, 89, 90, 92, 93, 94, 98, 99, 100, 102, 103, 104, 106, 107
Offset: 1

Views

Author

Tanya Khovanova and the MIT PRIMES STEP senior group, Dec 05 2024

Keywords

Comments

Each vertex of this tree has degree 4. If a vertex has at least 4 chips, the vertex fires and one chip is sent to each neighbor. The root sends 1 chip to its three children and one chip to itself.
The order of the firings doesn't affect the number of firings.
The corresponding sequence for a binary tree is A376116.
The corresponding sequence for a 4-ary tree is A378726.

Examples

			Suppose we start with 12 chips at the root. Then the root will fire 3 times, 12 chips total, three of which return to the root. The stable configuration will have 3 chips at the root and at every child of the root. Thus, a(4) = 3.
Suppose we start with 15 chips at the root. Then the root fires 3 times, 12 chips total, sending away 9 chips. Then the root can fire again, sending away 3 chips and keeping 3 chips. Now, each child of the root has four chips and can fire, returning to the root three more chips. Thus, the root can fire one more time. The stable configuration will have 3 chips at the root and 1 chip at each child and grandchild. Thus, a(5) = 5.

Links

Crossrefs

Cf. A376116, A378725, A378726, A378727, A378728.

Programs

  • Python
    from math import floor,log
def to_base(number, base): # Converts number to a base
   digits = []
   while number:
      digits.append(number % base)
      number //= base
   return list(digits)
def c(m,k,convert): # Calculates the c function
   try:
      num = to_base(convert,k)[m]
   except:
      num = 0
   return num+1
def F(N,k): # Calculated the F function
   n = floor(log(N*(k-1)+1)/log(k))
   convert = N - int((k**n-1)/(k-1))
   ans = 0
   for j in range(1,n):
      ans += (k**j-1)*c(j,k,convert)
   return int(ans/(k-1))
seq = []
for i in range(1,3*100+1,3): # Change this number to get more terms in the sequence
   seq.append(F(i+1,3))
print(', '.join(map(str,seq)),end='\n\n')

A378725 a(n) = A378724(n+1) - A378724(n).

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 3
Offset: 1

Views

Author

Tanya Khovanova and the MIT PRIMES STEP senior group, Dec 05 2024

Keywords

Comments

a(n) is the number of root fires on a rooted undirected infinite ternary tree with a self-loop at the root, when the chip-firing process starts with 3(n+1) chips at the root minus the number of root fires in the same tree, when a chip-firing process starts with 3n chips at the root.
The order of the firings doesn't affect the number of firings.

Examples

			Suppose we start with 12 chips at the root. Then the root will fire 3 times, 12 chips in total, 3 of which return to the root. The stable configuration will have 3 chips at the root and at every child of the root. Thus, the root fires 3 times in total.
Suppose we start with 15 chips at the root. Then the root will fire 3 times, sending away 9 chips. Then the root can fire again, sending away 3 chips and keeping 3 chips. Now, each child of the root has four chips, and they can also fire. Firing them returns three chips to the root. Thus, the root can fire one more time. The stable configuration will have 3 chips at the root and 1 chip at each child and grandchild. Thus, the root fires 5 times. It follows that a(4) = 5-3 = 2.

References

  • The difference sequence for binary trees is A091090.

Links

  • Dillan Agrawal, Selena Ge, Jate Greene, Tanya Khovanova, Dohun Kim, Rajarshi Mandal, Tanish Parida, Anirudh Pulugurtha, Gordon Redwine, Soham Samanta, and Albert Xu, Chip-Firing on Infinite k-ary Trees, arXiv:2501.06675 [math.CO], 2025. See p. 11.
  • Wikipedia, Chip-firing game.

Crossrefs

Cf. A091090, A378724, A378726, A378727, A378728.

Programs

  • Mathematica
    c[n_] := c[n] = Which[n == 1, 1, Mod[n, 3] != 1, 1, True, c[(n - 1)/3] + 1]; Array[c, 103, 1]
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.