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.

A363675 Numbers k such that the least common multiple of the degrees of the irreducible characters of S_k equals |S_k| = k!.

Original entry on oeis.org

0, 1, 6, 10, 21, 36, 66, 105, 120, 136, 190, 210, 276, 325, 465, 496, 561, 630, 666, 741, 780, 990, 1081, 1176, 1225, 1540, 1596, 1830, 2080, 2145, 2346, 2556, 2926, 3081, 3160, 3240, 3486, 3570, 3916, 4005, 4186, 4560, 4656, 4950, 5050, 5356, 5460, 5886, 6105
Offset: 1

Views

Author

Diego Martin Duro, Jun 14 2023

Keywords

Comments

Intersection of the sequences of numbers k such that there exists a 2-core partition of k (A267137) and a 3-core partition of k (A000217).

Crossrefs

Formula

From Alois P. Heinz, Jun 16 2023: (Start)
{ k : A175595(k,2) > 0 and A175595(k,3) > 0 }.
{ k : A010054(k) > 0 and A033687(k) > 0 }. (End)

Extensions

More terms from Alois P. Heinz, Jun 16 2023

A363701 Numbers k with the property that the character table of S_k contains a zero in every nontrivial column.

Original entry on oeis.org

0, 1, 5, 6, 8, 9, 10, 12, 14, 17, 21, 28, 30, 32, 34, 36, 37
Offset: 1

Views

Author

Diego Martin Duro, Jun 16 2023

Keywords

Comments

This sequence contains A363675 and A363676.

Crossrefs

Programs

  • Sage
    def zeros(n):
        G = SymmetricGroup(n)
        N = G.character_table()
        for j in range(1,N.ncols()):
            if 0 not in N[:,j]:
                return False
            j+=1
        return True
    n=1
    while n>0:
        if zeros(n) == True:
            print(n)
        n+=1
Showing 1-2 of 2 results.