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-2 of 2 results.

A347843 a(n) is the number of (strict) chains of subspaces with ends 0 and (F_5)^n.

Original entry on oeis.org

1, 1, 7, 249, 44643, 40065301, 179833594207, 4036127700341649, 452932494435315724443, 254139954749268142006053901, 712988623255130761190069046824407, 10001434425838325885839124865408303623049, 701474672607858244757589244286886103482442884243
Offset: 0

Views

Author

Álvar Ibeas, Sep 15 2021

Keywords

Examples

			a(3) = 249 = 1 * 1 + 31 * 2 + 186 * 1, counting:
the unrefined chain 0 < (F_5)^3;
31 chains 0 < V < (F_5)^3, with dim(V) = 1; another
31 chains 0 < V < (F_5)^3, with dim(V) = 2; and
186 chains 0 < V_1 < V_2 < (F_5)^3.
		

Crossrefs

Column k=5 of A381426.

Programs

  • Maple
    b:= proc(o, u, t) option remember; `if`(u+o=0, 1, `if`(t=1,
          b(u+o, 0$2), 0)+add(5^(u+j-1)*b(o-j, u+j-1, 1), j=1..o))
        end:
    a:= n-> b(n, 0$2):
    seq(a(n), n=0..16);  # Alois P. Heinz, Feb 21 2025

Formula

a(n) = Sum_{L partition of n} A347488(n, L) * A036038(len(L), sig(L)), where sig(L) is the partition composed by the part multiplicities of L.
a(n) = Sum_{k=0..binomial(n,2)} 5^k * A381299(n,k). - Alois P. Heinz, Feb 21 2025

Extensions

a(0)=1 prepended by Alois P. Heinz, Feb 21 2025

A348180 Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_5)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.

Original entry on oeis.org

1, 1, 4, 1, 9, 40, 1, 19, 56, 279, 1428, 1, 33, 289, 1561, 6345, 35689, 202421, 1, 55, 1358, 4836, 7652, 129505, 615395, 757560, 3620918, 21341449, 125952538, 1, 85, 5771, 80605, 33435, 2362185, 10691648, 53822709, 14039541, 321134138, 1622410155, 1916573757, 9688635876, 57866763847
Offset: 1

Views

Author

Álvar Ibeas, Oct 05 2021

Keywords

Comments

A permutation on the list of dimension increments does not modify the number of subspace chains.
The length of the enumerated chains is r = len(L), where L is the parameter partition.

Examples

			For L = (1, 1, 1), there are 186 (= 31 * 6) = A347488(3, 3) subspace chains 0 < V_1 < V_2 < (F_5)^3.
The permutations of the three coordinates classify them into 40 = T(3, 3) orbits.
T(3, 2) = 9 refers to partition (2, 1) and counts subspace chains in (F_5)^2 with dimensions (0, 2, 3), i.e. 2-dimensional subspaces. It also counts chains with dimensions (0, 1, 3), i.e. 1-dimensional subspaces.
Triangle begins:
  k:  1  2   3    4    5     6      7
      -------------------------------
n=1:  1
n=2:  1  4
n=3:  1  9  40
n=4:  1 19  56  279 1428
n=5:  1 33 289 1561 6345 35689 202421
		

Crossrefs

Formula

If the k-th partition of n in A-St is L = (a, n-a), then T(n, k) = A347972(n, a) = A347972(n, n-a).
Showing 1-2 of 2 results.