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.

A085483 Triangle read by rows: S_B(n,k) = "Type B" Stirling numbers of the second kind.

Original entry on oeis.org

2, 2, 5, 2, 15, 14, 2, 35, 84, 43, 2, 75, 350, 430, 142, 2, 155, 1260, 2795, 2130, 499, 2, 315, 4214, 15050, 19880, 10479, 1850, 2, 635, 13524, 73143, 149100, 132734, 51800, 7193, 2, 1275, 42350, 334110, 987042, 1320354, 854700, 258948, 29186, 2, 2555, 130620, 1466515, 6038550, 11390673, 10878000, 5394750, 1313370, 123109
Offset: 1

Views

Author

James East, Aug 15 2003

Keywords

Examples

			S_B(2,2)=5 because the relevant partitions of {-2,-1,1,2} are: {-2|-1|1|2}, {-1,1|-2|2}, {-1|1|-2,2}, {-1,1|-2,2}, {1,-2|-1,2}.
Triangle begins:
  2;
  2,   5;
  2,  15,   14;
  2,  35,   84,   43;
  2,  75,  350,  430,  142;
  2, 155, 1260, 2795, 2130, 499;
  ...
		

Crossrefs

S_B(n, 1) + ... + S_B(n, n) = A002872(n).

Programs

  • Mathematica
    nn = 10; f[n_] := Sum[2^(n - 3 k) n!/((n - 2 k)! k!), {k, 0, n}]; Do[f[n], {n, 0, nn}]; Table[f[k]*StirlingS2[n, k], {n, nn}, {k, n}] (* Michael De Vlieger, Sep 21 2022, after Robert G. Wilson v at A005425 *)

Formula

A partition of {-n, ..., -1, 1, ..., n} into nonempty subsets X_1, ..., X_r is called "symmetric" if for each i -X_i = X_j for some j. S_B(n, k) is the number of such symmetric partitions whose induced partition on {1, ..., n} involves k nonempty subsets. S_B(n, k) = S(n, k) * a(k), where S(n, k) is A008277 and a(k) is A005425.