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.

Previous Showing 11-13 of 13 results.

A213350 8-quantum transitions in systems of N >= 8 spin 1/2 particles, in columns by combination indices.

Original entry on oeis.org

1, 18, 180, 10, 1320, 220, 7920, 2640, 66, 41184, 22880, 1716, 192192, 160160, 24024, 364, 823680, 960960, 240240, 10920, 3294720, 5125120, 1921920, 174720, 1820, 12446720, 24893440, 13069056, 1980160, 61880, 44808192, 112020480
Offset: 8

Views

Author

Stanislav Sykora, Jun 13 2012

Keywords

Comments

For a general discussion, please see A213343.
This a(n) is for octuple-quantum transitions (q = 8).
It lists the flattened triangle T(8;N,k) with rows N = 8,9,... and columns k = 0..floor((N-8)/2).

Examples

			Starting rows of the triangle:
   N | k = 0, 1, ..., floor((N-8)/2)
  ---+------------------------------
   8 |    1
   9 |   18
  10 |  180   10
  11 | 1320  220
  12 | 7920 2640 66
		

References

Crossrefs

Cf. A051288 (q=0), A213343 to A213349 (q=1 to 7), A213351 (q=9), A213352 (q= 10).
Cf. A140325 (first row, with offset 8), A004314 (row sums).

Programs

  • Mathematica
    With[{q = 8}, Table[2^(n - q - 2 k)*Binomial[n, k] Binomial[n - k, q + k], {n, q, q + 10}, {k, 0, Floor[(n - q)/2]}]] // Flatten (* Michael De Vlieger, Nov 20 2019 *)
  • PARI
    See A213343; set thisq = 8

Formula

Set q = 8 in: T(q;N,k) = 2^(N-q-2*k)*binomial(N,k)*binomial(N-k,q+k)

A372868 Irregular triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of weak ascents, with 1 <= k <= ceiling(n/2).

Original entry on oeis.org

1, 2, 4, 1, 8, 6, 16, 24, 1, 32, 80, 10, 64, 240, 60, 1, 128, 672, 280, 14, 256, 1792, 1120, 112, 1, 512, 4608, 4032, 672, 18, 1024, 11520, 13440, 3360, 180, 1, 2048, 28160, 42240, 14784, 1320, 22, 4096, 67584, 126720, 59136, 7920, 264, 1, 8192, 159744, 366080, 219648, 41184, 2288, 26
Offset: 1

Views

Author

Stefano Spezia, May 15 2024

Keywords

Comments

With offset 0 for the variable k, T(n,k) is the number of flattened Catalan words of length n with exactly k peaks. In such case, T(4,1) = 6 corresponds to 6 flattened Catalan words of length 4 with 1 peak: 0010, 0100, 0110, 0101, 0120, and 0121. See Baril et al. at page 20.

Examples

			The irregular triangle begins:
    1;
    2;
    4,    1;
    8,    6;
   16,   24,    1;
   32,   80,   10;
   64,  240,   60,   1;
  128,  672,  280,  14;
  256, 1792, 1120, 112, 1;
  ...
T(4,2) = 6 since there are 6 flattened Catalan words of length 4 with 2 runs of weak ascents: 0010, 0100, 0101, 0110, 0120, and 0121.
		

Crossrefs

Cf. A000079, A001788, A002409, A003472, A007051 (row sums), A110654 (row lengths), A140325, A172242.

Programs

  • Mathematica
    T[n_,k_]:=SeriesCoefficient[(1-2x)*x*y/(1-4*x+4*x^2-x^2*y),{x,0,n},{y,0,k}]; Table[T[n,k],{n,14},{k,Ceiling[n/2]}] //Flatten (* or *)
    T[n_,k_]:=2^(n-2k+1)Binomial[n-1,2k-2]; Table[T[n,k],{n,14},{k,Ceiling[n/2]}]

Formula

G.f.: (1-2*x)*x*y/(1 - 4*x + 4*x^2 - x^2*y).
T(n,k) = 2^(n-2*k+1)*binomial(n-1, 2*k-2).
T(n,1) = A000079(n-1).
T(n,2) = A001788(n-2).
T(n,3) = A003472(n-1).
T(n,4) = A002409(n-7).
T(n,5) = A140325(n-9).
T(n,6) = A172242(n-1).
Sum_{k>=0} T(n,k) = A007051(n-1).

A130813 If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 7-subsets of X containing none of X_i, (i=1,...n).

Original entry on oeis.org

128, 1024, 4608, 15360, 42240, 101376, 219648, 439296, 823680, 1464320, 2489344, 4073472, 6449664, 9922560, 14883840, 21829632, 31380096, 44301312, 61529600, 84198400, 113667840, 151557120, 199779840, 260582400, 336585600, 430829568
Offset: 7

Views

Author

Milan Janjic, Jul 16 2007

Keywords

Comments

Number of n permutations (n>=7) of 3 objects u,v,z, with repetition allowed, containing n-7 u's. Example: if n=7 then n-7 =(0) zero u, a(1)=128. - Zerinvary Lajos, Aug 05 2008
a(n) is the number of 6-dimensional elements in an n-cross polytope where n>=7. - Patrick J. McNab, Jul 06 2015

Crossrefs

Programs

  • Magma
    [Binomial(n,n-7)*2^7: n in [7..40]]; // Vincenzo Librandi, Jul 09 2015
  • Maple
    a:=n->binomial(2*n,7)+binomial(n,2)*binomial(2*n-4,3)-n*binomial(2*n-2,5)-(2*n-6)*binomial(n,3);
    seq(binomial(n,n-7)*2^7,n=7..32); # Zerinvary Lajos, Dec 07 2007
    seq(binomial(n+6, 7)*2^7, n=1..22); # Zerinvary Lajos, Aug 05 2008
  • Mathematica
    Table[Binomial[n, n - 7] 2^7, {n, 7, 40}] (* Vincenzo Librandi, Jul 09 2015 *)

Formula

a(n) = binomial(2*n,7) + binomial(n,2)*binomial(2*n-4,3) - n*binomial(2*n-2,5) - (2*n-6)*binomial(n,3).
a(n) = C(n,n-7)*2^7, n>=7. - Zerinvary Lajos, Dec 07 2007
G.f.: 128*x^7/(1-x)^8. - Colin Barker, Mar 18 2012
a(n) = 128*A000580(n). a(n+1) = 2*(n+1)*a(n)/(n-6) for n >= 7. - Robert Israel, Jul 08 2015
Previous Showing 11-13 of 13 results.