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.

A082733 Sum of all entries in character table of the symmetric group S_n.

Original entry on oeis.org

1, 2, 5, 13, 31, 89, 259, 842, 2810, 10020, 37266, 145373, 586071, 2453927, 10590180, 47159351, 215706629, 1013916313, 4882544468, 24087770591, 121481296510, 626169893024, 3293432146879, 17670096206819, 96589760733604, 537731396393480, 3045955783377644
Offset: 1

Views

Author

Vladeta Jovovic, May 20 2003

Keywords

Examples

			a(3) = 5 because the character table of S_3 is / 1 1 1 / 2 0 -1 / 1 -1 1 /.
		

Crossrefs

Programs

  • GAP
    A082733 := n -> Sum(Sum(Irr(CharacterTable("Symmetric", n)))); # Eric M. Schmidt, Jul 03 2012
  • Mathematica
    a[n_] := FiniteGroupData[{"SymmetricGroup", n}, "CharacterTable"] // Flatten // Total;
    Table[an = a[n]; Print[n, " ", an]; an, {n, 1, 10}] (* Jean-François Alcover, Nov 03 2018 *)

Formula

Let D(x) = Sum_{n>=0} (2n-1)!!*x^n = 1/(1 - x/(1 - 2x/(1 - 3x/...))) and R_r(x) = Sum_{n>=0} o_r(n)*x^n = 1/(1 - x - r*x^2/(1 - x - 2*r*x^2/(1 - x - 3*r*x^2/...))), where o_r(n) = Sum_{k=0..n/2} binomial(n, 2k)*(2k-1)!!*r^k. Then the generating function of this sequence is Sum_{n>=0} a(n)*x^n = Product_{i >= 1} (D(2ix^{4i}) * R_{2i-1}(x^{2i-1}). - Arvind Ayyer, Jun 11 2024

Extensions

More terms from Eric M. Schmidt, Jul 03 2012

A225090 Minimal sum of entries of the character table of a group of order n.

Original entry on oeis.org

1, 2, 3, 4, 5, 5, 7, 8, 9, 8, 11, 8, 13, 11, 15, 14, 17, 14, 19, 11, 13, 17, 23, 13, 25, 20, 27, 22, 29, 23, 31, 26, 33, 26, 35, 18, 37, 29, 23, 22, 41, 17, 43, 34, 45, 35, 47, 24, 49, 38, 51, 25, 53, 30, 23, 20, 33, 44, 59, 19, 61, 47, 39, 44, 65, 50, 67, 32
Offset: 1

Views

Author

Eric M. Schmidt, Apr 27 2013

Keywords

Comments

The maximal sum of entries is just n, and this is achieved by any Abelian group of order n.
A060653(n) <= a(n) <= n.

Examples

			a(6)=5 because the sum of the entries in the character table of the symmetric group S3 is 5, the minimum for groups of order 6.
		

Crossrefs

Programs

  • GAP
    A225090 := function(n) local min, i; min := n; for i in [1..NumberSmallGroups(n)] do min := Minimum(min, Sum(Sum(Irr(SmallGroup(n, i))))); od; return min; end;
Showing 1-2 of 2 results.