A208529 -id:A208529 - cp's OEIS frontend

A007680 a(n) = (2n+1)*n!.

1, 3, 10, 42, 216, 1320, 9360, 75600, 685440, 6894720, 76204800, 918086400, 11975040000, 168129561600, 2528170444800, 40537905408000, 690452066304000, 12449059983360000, 236887827111936000, 4744158915944448000, 99748982335242240000

Offset: 0

N. J. A. Sloane

Denominators in series for sqrt(Pi/4)*erf(x): sqrt(Pi/4)*erf(x)= x/1 - x^3/3 + x^5/10 - x^7/42 + x^9/216 -+ ...
Appears to be the BinomialMean transform of A000354 (after truncating the first term of A000354). (See A075271 for the definition of BinomialMean.) - John W. Layman, Apr 16 2003
Number of permutations p of {1,2,...,n+2} such that max|p(i)-i|=n+1. Example: a(1)=3 since only the permutations 312,231 and 321 of {1,2,3} satisfy the given condition. - Emeric Deutsch, Jun 04 2003
Stirling transform of A000670(n+1) = [3, 13, 75, 541, ...] is a(n) = [3, 10, 42, 216, ...]. - Michael Somos, Mar 04 2004
Stirling transform of a(n) = [2, 10, 42, 216, ...] is A052875(n+1) = [2, 12, 74, ...]. - Michael Somos, Mar 04 2004
A related sequence also arises in evaluating indefinite integrals of sec(x)^(2k+1), k=0, 1, 2, ... Letting u = sec(x) and d = sqrt(u^2-1), one obtains a(0) = log(u+d) 2*k*a(k) = (2*k-1)*u^(2*k-1)*d + a(k-1). Viewing these as polynomials in u gives 2^k*k!*a(k) = a(0) + d*Sum(i=0..k-1){ (2*i+1)*i!*2^i*u^(2*i+1) }, which is easily proved by induction. Apart from the power of 2, which could be incorporated into the definition of u (or by looking at erf(ix/2)/ i (i=sqrt(-1)), the sum's coefficients form our series and are the reciprocals of the power series terms for -sqrt(-Pi/4)*erf(ix/2)). This yields a direct but somewhat mysterious relationship between the power series of erf(x) and integrals involving sec(x). - William A. Huber (whuber(AT)quantdec.com), Mar 14 2002
When written in factoradic ("factorial base"), this sequence from a(1) onwards gives the smallest number containing two adjacent digits, increasing when read from left to right, whose difference is n-1. - Christian Perfect, May 03 2016
a(n-1)^2 is the number of permutations p of [1..2n] such that Sum_{i=1..2n} abs(p(i)-i) = 2n^2-2. - Fang Lixing, Dec 07 2018
A standard series for the calculation of coordinates on a clothoid (also called cornuspiral):
  x = s*(a(0) - (tau^2/a(2)) + (tau^4/a(4)) - (tau^6/a(6)) + ...)
  y = s*((tau/a(1)) + (tau^3/a(3)) - (tau^5/a(5)) + ...).
  s is the arclength from the clothoids origin to the desired point p(x,y). The tangent at the clothoids origin intersects with the tangent at the point p(x,y) with an angle of tau. - Thomas Scheuerle, Oct 13 2021
a(n) = P_n(1) where P_n(x) is the Pidduck polynomials. - Michael Somos, May 27 2023

			G.f. = 1 + 3*x + 10*x^2 + 42*x^3 + 216*x^4 + 1320*x^5 + 9360*x^6 + ... - _Michael Somos_, Jan 01 2019

H. W. Gould, A class of binomial sums and a series transform, Utilitas Math., 45 (1994), 71-83.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. Wirth, Systematisches Programmieren, 1975, exercise 9.3

Vincenzo Librandi, Table of n, a(n) for n = 0..400
Emeric Deutsch, Problem Q915, Math. Magazine, vol. 74, No. 5, 2001, p. 404.
H. W. Gould, A class of binomial sums and a series transform, Utilitas Math., 45 (1994), 71-83. (Annotated scanned copy)
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
M. Z. Spivey and L. L. Steil, The k-Binomial Transforms and the Hankel Transform, J. Integ. Seqs. Vol. 9 (2006), #06.1.1.
Eric Weisstein's World of Mathematics, Erf
Wikipedia, Factorial base
Wikipedia, Pidduck polynomials
Jun Yan, Results on pattern avoidance in parking functions, arXiv:2404.07958 [math.CO], 2024. See p. 5.

From Johannes W. Meijer, Nov 12 2009: (Start)
Appears in A167546.
Equals the rows sums of A167556.
(End)
Cf. A019704, A099288.

a:=List([0..20],n->(2*n+1)*Factorial(n));; Print(a); # Muniru A Asiru, Jan 01 2019

[(2*n+1)*Factorial(n): n in [0..20]]; // Vincenzo Librandi, Aug 20 2011

[(2*n+1)*factorial(n)$n=0..20]; # Muniru A Asiru, Jan 01 2019

Table[(2n + 1)*n!, {n, 0, 20}] (* Stefan Steinerberger, Apr 08 2006 *)

{a(n) = if( n<0, 0, (2*n+1) * n!)}; /* Michael Somos, Mar 04 2004 */

E.g.f.: (1+x)/(1-x)^2.
This is the binomial mean transform of A000354 (after truncating the first term). See Spivey and Steil (2006). - Michael Z. Spivey (mspivey(AT)ups.edu), Feb 26 2006
E.g.f.: (of aerated sequence) 1+x^2/2+sqrt(pi)*(x+x^3/4)*exp(x^2/4)*ERF(x/2). - Paul Barry, Apr 11 2010
G.f.: 1 + x*G(0), where G(k)= 1 + x*(k+1)/(1 - (k+2)/(k+2 + (k+1)/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jul 08 2013
a(n-2) = (A208528(n)+A208529(n))/2, for n>=2. - Luis Manuel Rivera Martínez, Mar 05 2014
D-finite with recurrence: (-2*n+1)*a(n) +n*(2*n+1)*a(n-1)=0. - R. J. Mathar, Jan 27 2020
Sum_{n>=0} 1/a(n) = sqrt(Pi)*erfi(1)/2 = A019704 * A099288 = A347910. - Amiram Eldar, Oct 07 2020
Sum_{n>=0} (-1)^n/a(n) = A347909 . - R. J. Mathar, Sep 30 2021

A098916 Permanent of the n X n (0,1)-matrices with ij-th entry equal to zero iff (i=1,j=1),(i=1,j=n),(i=n,j=1) and (i=n,j=n).

Original entry on oeis.org

0, 4, 36, 288, 2400, 21600, 211680, 2257920, 26127360, 326592000, 4390848000, 63228211200, 971415244800, 15866448998400, 274611617280000, 5021469573120000, 96746980442112000, 1959126353952768000

Offset: 3

Simone Severini, Oct 17 2004

nonn

The number of all possible ways to permute n distinct aligned balls, one is blue, 2 are red and the remaining are green, such that no red ball occurs by the side of the blue ball. It may generalized to r red balls: a(n,r) = (n-r-1)(n-r)(n-2)!. - Alessandro Nicolosi (xxalenicxx(AT)hotmail.com), Jul 12 2006
A formula for the permanents of these n X n matrices(A) can be easily derived by minor expansion along the first row: a(n)=per(A)=(n-2)*per(B), where B is the n-1 X n-1 (0,1)-matrix with bij=0 iff (i=n,j=1) and (i=n,j=n). A new minor expansion along the last row of B yields: per(B)=(n-3)*per(C)=(n-3)*(n-2)! since C is the n-2 X n-2 1-matrix. Hence: a(n)=(n-2)*(n-3)*(n-2)!. - Herman Jamke (hermanjamke(AT)fastmail.fm), May 13 2007
Number of permutations of n-1 having exactly 4 points P on the boundary of their bounding square. (A bounding square for a permutation of n is the square with sides parallel to the coordinate axis containing (1,1) and (n,n), and the set of points P of a permutation p is the set {(k,p(k)) for 0David Nacin, Feb 27 2012
a(n) is also the number of permutations of n symbols that 4-commute with a transposition (see A233440 for definition): a permutation p of {1,...,n} has exactly four points on the boundary of their bounding square if and only if p 4-commutes with transposition (1, n). - Luis Manuel Rivera Martínez, Feb 27 2014

			a(3) = 0 because no configuration is allowed, the 2 red balls always occurs by the side of the blue ball. a(4) = 4 because we can have 4 possible permutations: b,g1,r1,r2 b,g1,r2,r1 r1,r2,g1,b r2,r1,g1,b.

Vincenzo Librandi, Table of n, a(n) for n = 3..200
Emeric Deutsch, Permutations and their bounding squares, Math Magazine, 85(1) (2012), p. 63.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.

Cf. A208528, A208529.

Cf. A001113, A001620, A099285.

a:= n->(n-2)*(n-3)*(n-2)!: seq(a(n), n=3..20); # Zerinvary Lajos, Jul 01 2007

a[n_,r_] := (n-r-1)(n-r)(n-2)! (* Alessandro Nicolosi (xxalenicxx(AT)hotmail.com), Jul 12 2006 *)
Table[(n-2)*(n-3)*(n-2)!,{n,3,30}] (* Vincenzo Librandi, Feb 27 2012 *)

permRWNb(a)=n=matsize(a)[1]; if(n==1,return(a[1,1])); sg=1; in=vectorv(n); x=in; x=a[,n]-sum(j=1,n,a[,j])/2; p=prod(i=1,n,x[i]); for(k=1,2^(n-1)-1,sg=-sg; j=valuation(k,2)+1; z=1-2*in[j]; in[j]+=z; x+=z*a[,j]; p+=prod(i=1,n,x[i],sg)); return(2*(2*(n%2)-1)*p)
for(n=3,24,a=matrix(n,n,i,j,1); a[1,1]=0; a[1,n]=0; a[n,1]=0; a[n,n]=0; print1(permRWNb(a)", ")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), May 13 2007

for(n=3,24,print1((n-2)*(n-3)*(n-2)!", ")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), May 13 2007

import math
def a(n):
    return (n-2)*(n-3)*math.factorial(n-2) # David Nacin, Feb 27 2012

a(n) = (n-2)*(n-3)*(n-2)!. - Herman Jamke (hermanjamke(AT)fastmail.fm), May 13 2007
From Amiram Eldar, May 17 2022: (Start)
Sum_{n>=4} 1/a(n) = 3 - e, where e = A001113.
Sum_{n>=4} (-1)^n/a(n) = 2*(gamma - Ei(-1)) - 1/e - 1, where gamma = A001620 and Ei(-1) = -A099285. (End)

More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 13 2007

A208528 Number of permutations of n>1 having exactly 3 points P on the boundary of their bounding square.

Original entry on oeis.org

0, 4, 16, 72, 384, 2400, 17280, 141120, 1290240, 13063680, 145152000, 1756339200, 22992076800, 323805081600, 4881984307200, 78460462080000, 1339058552832000, 24186745110528000, 460970906812416000, 9245027631071232000, 194632160654131200000

Offset: 2

David Nacin, Feb 27 2012

nonn

A bounding square for a permutation of n is the square with sides parallel to the coordinate axis containing (1,1) and (n,n), and the set of points P of a permutation p is the set {(k,p(k)) for 0

a(n) is the number of permutations of n symbols that 3-commute with a transposition (see A233440 for definition): a permutation p of {1,...,n} has exactly three points on the boundary of their bounding square if and only if p 3-commutes with transposition (1, n). - Luis Manuel Rivera Martínez, Feb 27 2014

			a(3) = 4 because {(1,1),(2,3),(3,2)}, {(1,3),(2,1),(3,2)}, {(1,2),(2,3),(3,1)} and {(1,2),(2,1),(3,3)} each have three points on the bounding square.

Vincenzo Librandi, Table of n, a(n) for n = 2..200
Emeric Deutsch, Permutations and their bounding squares, Math Magazine, 85(1) (2012), p. 63.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.

Cf. A098916, A208529.

Cf. A001620, A091725, A099285.

Mathematica
```
Table[(4n-8)(n-2)!, {n, 2, 10}]
```

import math
def a(n):
    return (4*n-8)*math.factorial(n-2)

a(n) = (4*n-8) * (n-2)!
From Amiram Eldar, May 17 2022: (Start)
Sum_{n>=3} 1/a(n) = (Ei(1) - gamma)/4, where Ei(1) = A091725 and gamma = A001620.
Sum_{n>=3} (-1)^(n+1)/a(n) = (gamma - Ei(-1))/4, where Ei(-1) = -A099285. (End)

A306641 A(n,k) = Sum_{j=0..n} (kn)!/(j! (n-j)!)^k, square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.

Original entry on oeis.org

1, 1, 2, 1, 2, 3, 1, 4, 4, 4, 1, 12, 36, 8, 5, 1, 48, 900, 400, 16, 6, 1, 240, 45360, 94080, 4900, 32, 7, 1, 1440, 3855600, 60614400, 11988900, 63504, 64, 8, 1, 10080, 493970400, 82065984000, 114144030000, 1704214512, 853776, 128, 9

Offset: 0

Seiichi Manyama, Mar 02 2019

Columns are the number of maximal chains to multiples of J in the graded poset of (2 X n) antimagic squares. See Stanley. - Arnav Krishna, Jan 13 2023

			Square array begins:
   1,  1,     1,          1,               1, ...
   2,  2,     4,         12,              48, ...
   3,  4,    36,        900,           45360, ...
   4,  8,   400,      94080,        60614400, ...
   5, 16,  4900,   11988900,    114144030000, ...
   6, 32, 63504, 1704214512, 249344297250048, ...

R. P. Stanley, Enumerative Combinatorics, Vol I, Exercise 53, p. 540.

Seiichi Manyama, Antidiagonals n = 0..49, flattened

Columns 0-3 give A000027(n+1), A000079, A002894, A306642, A345646.
Rows 0-1 give A000012, A208529(n+2).
Main diagonal gives A306644.

A256031 Number of irreducible idempotents in partial Brauer monoid PB_n.

Original entry on oeis.org

2, 3, 12, 30, 240, 840, 10080, 45360, 725760, 3991680, 79833600, 518918400, 12454041600, 93405312000, 2615348736000, 22230464256000, 711374856192000, 6758061133824000, 243290200817664000, 2554547108585472000, 102181884343418880000, 1175091669949317120000

Offset: 1

N. J. A. Sloane, Mar 14 2015

nonn

Table 2 in chapter 7 of the preprint contains a typo: a(9) is not 725860. - R. J. Mathar, Mar 14 2015

I. Dolinka, J. East, A. Evangelou, D. FitzGerald, N. Ham, J. Hyde and N. Loughlin, Enumeration of idempotents in diagram semigroups and algebras, arXiv preprint arXiv:1408.2021 [math.GR], 2014. See Prop. 22.

Cf. A052612, A052616, A052849, A098558, A208529, A256032, A174549 (bisection).

A256031 := proc(n)
    if type(n,'odd') then
        2*n! ;
    else
        (n+1)*(n-1)! ;
    end if;
end proc:
seq(A256031(n),n=1..20) ; # R. J. Mathar, Mar 14 2015

a[n_] := If[OddQ[n], 2*n!, (n + 1)*(n - 1)!];
Array[a, 20] (* Jean-François Alcover, Nov 24 2017, from Maple *)

There are simple formulas for the two bisections - see Dolinka et al.
a(2n-1) = A052612(2n-1) = A052616(2n-1) = A052849(2n-1) = A098558(2n-1) = A208529(2n+1). - Omar E. Pol, Mar 14 2015
Sum_{n>=1} 1/a(n) = (e^2+3)/(4*e) = 1/e + sinh(1)/2. - Amiram Eldar, Feb 02 2023

A125553 Triangle read by rows: T(n,k) = S1(n,k)*2^k, where S1(n,k) is an unsigned Stirling number of the first kind (cf. A008275) (n >= 1, 1 <= k <= n).

Original entry on oeis.org

2, 2, 4, 4, 12, 8, 12, 44, 48, 16, 48, 200, 280, 160, 32, 240, 1096, 1800, 1360, 480, 64, 1440, 7056, 12992, 11760, 5600, 1344, 128, 10080, 52272, 105056, 108304, 62720, 20608, 3584, 256, 80640, 438336, 944992, 1076544, 718368, 290304, 69888, 9216, 512

Offset: 1

N. J. A. Sloane, Jan 04 2007

Row sums are factorial numbers.
T(n,k) is the number of cycle-colored n-permutations possessing exactly k cycles; two colors are available. - Steven Finch, Nov 19 2021
Subtriangle (for 1<=k<=n) of triangle given by [0,1,1,2,2,3,3,4,4,5,5,...] DELTA [2,0,2,0,2,0,2,0,2,0,...] where DELTA is the operator defined in A084938. - Philippe Deléham, Jan 05 2007
Also the Bell transform of the sequence "a(n) = 2*(n+1)!/(n+1)". For the definition of the Bell transform see A264428. - Peter Luschny, Jan 27 2016

			Triangle begins:
  2
  2 4
  4 12 8
  12 44 48 16
  48 200 280 160 32
Triangle [0,1,1,2,2,3,3,...] DELTA [2,0,2,0,2,0,2,...], for 0<=k<=n, begins:
  1;
  0, 2;
  0, 2, 4;
  0, 4, 12, 8;
  0, 12, 44, 48, 16;
  0, 48, 200, 280, 160, 32;

Steven Finch, Rounds, Color, Parity, Squares, arXiv:2111.14487 [math.CO], 2021.

Cf. A008275, A208529.

with(combinat): T:=(n,k)->2^k*abs(stirling1(n,k)): for n from 1 to 10 do seq(T(n,k),k=1..n) od; # yields sequence in triangular form - Emeric Deutsch, Jan 05 2007
A008275 := proc(n,k) if n = 0 and k = 0 then 1 ; elif n = 0 or k = 0 then 0 ; else A008275(n-1,k-1)-(n-1)*A008275(n-1,k) ; fi ; end ; A125553 := proc(n,k) abs(A008275(n,k)*2^k) ; end ; nmax := 10 ; for n from 1 to nmax do for k from 1 to n do printf("%d, ",A125553(n,k)) ; od ; od ; # R. J. Mathar, Jan 12 2007
# The function BellMatrix is defined in A264428.
# Adds (1,0,0,0, ..) as column 0.
BellMatrix(n -> 2*(n+1)!/(n+1), 9); # Peter Luschny, Jan 27 2016

Flatten[Table[Table[2^k Abs[StirlingS1[n,k]], {k,1,n}], {n,1,8}]] (* Geoffrey Critzer, Dec 14 2011 *)
BellMatrix[f_, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
B = BellMatrix[Function[n, 2 (n + 1)!/(n + 1)], rows = 12];
Table[B[[n, k]], {n, 2, rows}, {k, 2, n}] // Flatten (* Jean-François Alcover, Jun 28 2018, after Peter Luschny *)

E.g.f.: 1/(1-x)^(2y). - Geoffrey Critzer, Dec 14 2011

More terms from R. J. Mathar, Jan 12 2007

A256881 a(n) = n!/ceiling(n/2).

Original entry on oeis.org

1, 2, 3, 12, 40, 240, 1260, 10080, 72576, 725760, 6652800, 79833600, 889574400, 12454041600, 163459296000, 2615348736000, 39520825344000, 711374856192000, 12164510040883200, 243290200817664000, 4644631106519040000, 102181884343418880000, 2154334728240414720000

Offset: 1

M. F. Hasler, Apr 22 2015

nonn

Original name was: n!/round(n/2). - Robert Israel, Sep 03 2018

Robert Israel, Table of n, a(n) for n = 1..450
Pierre-Alain Sallard, Sum of repeated integrals of sinh.

Cf. A009445, A052612, A052616, A052849, A081457, A208529, A098558, A107991, A110468, A229244, A256031.

[Factorial(n)/Round(n/2): n in [1..30]]; // Vincenzo Librandi, Apr 23 2015

Maple
```
A256881 := n!/round(n/2);
```

Function[x, 1/x] /@
CoefficientList[Series[(Sinh[x] + x*Exp[x])/2, {x, 0, 20}], x] (* Pierre-Alain Sallard, Dec 15 2018 *)

PARI
```
A256881(n)=n!/round(n/2)
```

a(2n) = 2*A009445(n) = A052612(2n-1) = A052616(2n-1) = A052849(2n-1) = A098558(2n-1) = A081457(3n-1) = A208529(2n+1) = A256031(2n-1).
a(2n+1) = A110468(n) = A107991(2n+2) = A229244(2n+1), n>=0.
From Robert Israel, Sep 03 2018: (Start)
E.g.f.: -(1+1/x)*log(1-x^2).
n*(n+1)*(n+2)*a(n)+(n+2)*a(n+1)-(n+3)*a(n+2)=0. (End)
a(n) = 2/([x^n](sinh(x) + x*exp(x))). - Pierre-Alain Sallard, Dec 15 2018
Sum_{n>=1} 1/a(n) = (3*e-1/e)/4 = (e + sinh(1))/2. - Amiram Eldar, Feb 02 2023

Definition clarified by Robert Israel, Sep 03 2018

A360174 Triangle read by rows. T(n, k) = (k + 1) * abs(Stirling1(n, k)).

Original entry on oeis.org

1, 0, 2, 0, 2, 3, 0, 4, 9, 4, 0, 12, 33, 24, 5, 0, 48, 150, 140, 50, 6, 0, 240, 822, 900, 425, 90, 7, 0, 1440, 5292, 6496, 3675, 1050, 147, 8, 0, 10080, 39204, 52528, 33845, 11760, 2254, 224, 9, 0, 80640, 328752, 472496, 336420, 134694, 31752, 4368, 324, 10

Offset: 0

Peter Luschny, Feb 08 2023

			Triangle T(n, k) starts:
[0] 1;
[1] 0,     2;
[2] 0,     2,     3;
[3] 0,     4,     9,     4;
[4] 0,    12,    33,    24,     5;
[5] 0,    48,   150,   140,    50,     6;
[6] 0,   240,   822,   900,   425,    90,    7;
[7] 0,  1440,  5292,  6496,  3675,  1050,  147,   8;
[8] 0, 10080, 39204, 52528, 33845, 11760, 2254, 224, 9;

Cf. A208529 (column 1), A006002 (subdiagonal), A000774 (row sums).

Cf. A069138 (Stirling2 counterpart), A360205 (Lah counterpart).

T := (n, k) -> (k + 1)*abs(Stirling1(n, k)):
for n from 0 to 8 do seq(T(n, k), k = 0..n) od;

A240533 a(n) = numerators of n!/10^n.

Original entry on oeis.org

1, 1, 1, 3, 3, 3, 9, 63, 63, 567, 567, 6237, 18711, 243243, 1702701, 5108103, 5108103, 86837751, 781539759, 14849255421, 14849255421, 311834363841, 3430178002251, 78894094051773, 236682282155319, 236682282155319, 3076869668019147, 83075481036516969

Offset: 0

Vincenzo Librandi, Apr 14 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000142, A011557, A014973, A074143, A092043, A208529.

[Numerator(Factorial(n)/10^n): n in [0..30]];

Mathematica
```
Table[Numerator[n!/10^n], {n, 0, 30}]
```

A240534 a(n) = denominators of n!/10^n.

Original entry on oeis.org

1, 10, 50, 500, 1250, 2500, 12500, 125000, 156250, 1562500, 1562500, 15625000, 39062500, 390625000, 1953125000, 3906250000, 2441406250, 24414062500, 122070312500, 1220703125000, 610351562500, 6103515625000, 30517578125000

Offset: 0

Vincenzo Librandi, Apr 14 2014

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000142, A011557, A014973, A074143, A092043, A208529.

[Denominator(Factorial(n)/10^n): n in [0..30]];

Mathematica
```
Table[Denominator[n!/10^n], {n, 0, 30}]
```

Showing 1-10 of 10 results.

cp's OEIS Frontend

A007680 a(n) = (2n+1)*n!.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Formula

A098916 Permanent of the n X n (0,1)-matrices with ij-th entry equal to zero iff (i=1,j=1),(i=1,j=n),(i=n,j=1) and (i=n,j=n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A208528 Number of permutations of n>1 having exactly 3 points P on the boundary of their bounding square.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

A306641 A(n,k) = Sum_{j=0..n} (k*n)!/(j! * (n-j)!)^k, square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A256031 Number of irreducible idempotents in partial Brauer monoid PB_n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A125553 Triangle read by rows: T(n,k) = S1(n,k)*2^k, where S1(n,k) is an unsigned Stirling number of the first kind (cf. A008275) (n >= 1, 1 <= k <= n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A256881 a(n) = n!/ceiling(n/2).

Views

A306641 A(n,k) = Sum_{j=0..n} (kn)!/(j! (n-j)!)^k, square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.