A034827 -id:A034827 - cp's OEIS frontend

A206817 Sum_{0

1, 10, 73, 520, 3967, 33334, 309661, 3166468, 35416555, 430546642, 5655609529, 79856902816, 1206424711303, 19419937594990, 331860183278677, 6000534640290364, 114462875817046051, 2297294297649673738, 48394006967070653425

Offset: 2

Clark Kimberling, Feb 12 2012

nonn

In the following guide to related sequences,

c(n) = Sum_{0

t(n) = Sum_{0

s(k).................c(n)........t(n)

k....................A000217.....A000292

k^2..................A016061.....A004320

k^3..................A206808.....A206809

k^4..................A206810.....A206811

k!...................A206816.....A206817

prime(k).............A152535.....A062020

prime(k+1)...........A185382.....A206803

2^(k-1)..............A000337.....A045618

k(k+1)/2.............A007290.....A034827

k-th quarter-square..A049774.....A206806

			a(3) = (2-1) + (6-1) + (6-2) = 10.

Danny Rorabaugh, Table of n, a(n) for n = 2..400

Cf. A000142, A206816.

s[k_] := k!; t[1] = 0;
p[n_] := Sum[s[k], {k, 1, n}];
c[n_] := n*s[n] - p[n];
t[n_] := t[n - 1] + (n - 1) s[n] - p[n - 1];
Table[c[n], {n, 2, 32}]          (* A206816 *)
Flatten[Table[t[n], {n, 2, 20}]] (* A206817 *)

a(n)=sum(j=1,n,j!*(2*j-n-1)) \\ Charles R Greathouse IV, Oct 11 2015

a(n)=my(t=1); sum(j=1,n,t*=j; t*(2*j-n-1)) \\ Charles R Greathouse IV, Oct 11 2015

[sum([sum([factorial(k)-factorial(j) for j in range(1,k)]) for k in range(2,n+1)]) for n in range(2,21)] # Danny Rorabaugh, Apr 18 2015

a(n) = a(n-1)+(n-1)s(n)-p(n-1), where s(n) = n! and p(k) = 1!+2!+...+k!.

a(n) = Sum_{k=2..n} A206816(k).

A033486 a(n) = n(n + 1)(n + 2)*(n + 3)/2.

Original entry on oeis.org

0, 12, 60, 180, 420, 840, 1512, 2520, 3960, 5940, 8580, 12012, 16380, 21840, 28560, 36720, 46512, 58140, 71820, 87780, 106260, 127512, 151800, 179400, 210600, 245700, 285012, 328860, 377580, 431520, 491040, 556512, 628320, 706860, 792540, 885780, 987012

Offset: 0

N. J. A. Sloane

a(n) is the area of an irregular quadrilateral with vertices at (1,1), (n+1, n+2), ((n+1)^2, (n+2)^2) and ((n+1)^3, (n+2)^3). - Art Baker, Dec 08 2018

G. C. Greubel, Table of n, a(n) for n = 0..5000 (terms 0..680 from Vincenzo Librandi)
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000332, A050534, A033488, A033487, A060008.

List([0..40],n->n*(n+1)*(n+2)*(n+3)/2); # Muniru A Asiru, Dec 08 2018

[n*(n+1)*(n+2)*(n+3)/2: n in [0..40]]; // Vincenzo Librandi, Apr 28 2011

[seq(12*binomial(n+3,4),n=0..32)]; # Zerinvary Lajos, Nov 24 2006

Table[n*(n + 1)*(n + 2)*(n + 3)/2, {n, 0, 50}] (* David Nacin, Mar 01 2012 *)
LinearRecurrence[{5,-10,10,-5,1},{0,12,60,180,420},40] (* Harvey P. Dale, Feb 04 2015 *)

a(n)=n*(n+1)*(n+2)*(n+3)/2 \\ Charles R Greathouse IV, Oct 07 2015

[12*binomial(n+3,4) for n in range(40)] # G. C. Greubel, Dec 08 2018

a(n) = 6*A034827(n+3) = 12*A000332(n+3).
G.f.: 12*x/(1 - x)^5. - Colin Barker, Mar 01 2012
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) with a(0) = 0, a(1) = 12, a(2) = 60, a(3) = 180, a(4) = 420. - Harvey P. Dale, Feb 04 2015
E.g.f.: (24*x + 36*x^2 + 12*x^3 + x^4)*exp(x)/2. - Franck Maminirina Ramaharo, Dec 08 2018
From Amiram Eldar, Sep 04 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/9.
Sum_{n>=1} (-1)^(n+1)/a(n) = 8*(3*log(2)-2)/9. (End)

A155856 Triangle T(n,k) = binomial(2n-k, k)(n-k)!, read by rows.

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 6, 10, 6, 1, 24, 42, 30, 10, 1, 120, 216, 168, 70, 15, 1, 720, 1320, 1080, 504, 140, 21, 1, 5040, 9360, 7920, 3960, 1260, 252, 28, 1, 40320, 75600, 65520, 34320, 11880, 2772, 420, 36, 1, 362880, 685440, 604800, 327600, 120120, 30888, 5544, 660, 45, 1

Offset: 0

Paul Barry, Jan 29 2009

Row sums of B^{-1}*A155856*B^{-1} are A000166 with B=A007318.

Downward diagonals T(n+j, n) = j!*binomial(n+j, n) = j!*seq(j), where seq(j) are sequences A010965, A010967, ..., A011101, A017714, A017716, ..., A017764, for 6 <= j <= 50, respectively. - G. C. Greubel, Jun 04 2021

			Triangle begins:
     1;
     1,    1;
     2,    3,    1;
     6,   10,    6,    1;
    24,   42,   30,   10,    1;
   120,  216,  168,   70,   15,   1;
   720, 1320, 1080,  504,  140,  21,  1;
  5040, 9360, 7920, 3960, 1260, 252, 28, 1;

G. C. Greubel, Rows n = 0..50 of the triangle, flattened
Veronica Bitonti, Bishal Deb, and Alan D. Sokal, Thron-type continued fractions (T-fractions) for some classes of increasing trees, arXiv:2412.10214 [math.CO], 2024. See p. 58.

Cf. A155857 (row sums), A155858 (diagonal sums).

Table[Binomial[2n-k,k](n-k)!,{n,0,10},{k,0,n}]//Flatten (* Harvey P. Dale, Mar 24 2017 *)

flatten([[factorial(n-k)*binomial(2*n-k, k) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, Jun 04 2021

T(n,k) = binomial(2*n-k, k)*(n-k)!.
Sum_{k=0..n} T(n, k) = A155857(n)
Sum_{k=0..floor(n/2)} T(n-k, k) = A155858(n) (diagonal sums).
G.f.: 1/(1-xy-x/(1-xy-x/(1-xy-2x/(1-xy-2x/(1-xy-3x/(1-.... (continued fraction).
From G. C. Greubel, Jun 04 2021: (Start)
  T(n, 0) = A000142(n).        T(n+1, n) = A000217(n+1).
T(n+1, 1) = A007680(n).        T(n+2, n) = A034827(n+4).
T(n+2, 2) = A175925(n).        T(n+3, n) = A253946(n).
T(2*n, n) = A064352(n)         T(n+4, n) = 4!*A000581(n).
T(n+1, n) = A000217(n+1).      T(n+5, n) = 5!*A001287(n).  (End)

A080159 Triangular array of ways of drawing k non-intersecting chords between n points on a circle; i.e., Motzkin polynomial coefficients.

Original entry on oeis.org

1, 1, 0, 1, 1, 0, 1, 3, 0, 0, 1, 6, 2, 0, 0, 1, 10, 10, 0, 0, 0, 1, 15, 30, 5, 0, 0, 0, 1, 21, 70, 35, 0, 0, 0, 0, 1, 28, 140, 140, 14, 0, 0, 0, 0, 1, 36, 252, 420, 126, 0, 0, 0, 0, 0, 1, 45, 420, 1050, 630, 42, 0, 0, 0, 0, 0, 1, 55, 660, 2310, 2310, 462, 0, 0, 0, 0, 0, 0, 1, 66, 990, 4620

Offset: 0

Henry Bottomley, Jan 31 2003

			Rows start: 1; 1,0; 1,1,0; 1,3,0,0; 1,6,2,0,0; 1,10,10,0,0,0; 1,15,30,5,0,0,0; etc.

Visible version of A055151. Row sums are A001006 (Motzkin numbers). Columns include A000012, A000217, A034827 and perhaps A000910.

For n >= 2k: T(n, k) = n!/((n-2k)!k!(k+1)!) = A007318(n, 2k)*A000108(k).

T(n,k) = A055151(n,k).

A190909 Triangle read by rows: T(n,k) = binomial(n+k,n-k) * k! / floor(k/2)!^2.

Original entry on oeis.org

1, 1, 1, 1, 3, 2, 1, 6, 10, 6, 1, 10, 30, 42, 6, 1, 15, 70, 168, 54, 30, 1, 21, 140, 504, 270, 330, 20, 1, 28, 252, 1260, 990, 1980, 260, 140, 1, 36, 420, 2772, 2970, 8580, 1820, 2100, 70, 1, 45, 660, 5544, 7722, 30030, 9100, 16800, 1190, 630

Offset: 0

Peter Luschny, May 24 2011

The triangle may be regarded as a generalization of the triangle A063007.
A063007(n,k) = binomial(n+k, n-k)*(2*k)$;
T(n,k) = binomial(n+k, n-k)*(k)$.
Here n$ denotes the swinging factorial A056040(n). As A063007 is a decomposition of the central Delannoy numbers A001850, a combinatorial interpretation of T(n,k) in terms of lattice paths can be expected.
T(n,n) = A056040(n) which can be seen as extended central binomial numbers.

			[0]  1
[1]  1,  1
[2]  1,  3,   2
[3]  1,  6,  10,    6
[4]  1, 10,  30,   42,   6
[5]  1, 15,  70,  168,  54,   30
[6]  1, 21, 140,  504, 270,  330,  20
[7]  1, 28, 252, 1260, 990, 1980, 260, 140

Peter Luschny, The lost Catalan numbers
R. A. Sulanke, Objects counted by the central Delannoy numbers, J. Integer Seq. 6 (2003), no. 1, Article 03.1.5.

Cf. Row sums: A190910; A056040, A063007, A085478, A088617.

A190909 := (n,k) -> binomial(n+k,n-k)*k!/iquo(k,2)!^2:
seq(print(seq(A190909(n,k),k=0..n)),n=0..7);

Flatten[Table[Binomial[n+k,n-k] k!/(Floor[k/2]!)^2,{n,0,10},{k,0,n}]] (* Harvey P. Dale, Mar 25 2012 *)

T(n,1) = A000217(n). T(n,2) = 2*binomial(n+2,4) (Cf. A034827).

A290775 Number of 5-cycles in the n-triangular honeycomb bishop graph.

Original entry on oeis.org

0, 0, 2, 24, 138, 532, 1596, 4032, 8988, 18216, 34254, 60632, 102102, 164892, 256984, 388416, 571608, 821712, 1156986, 1599192, 2174018, 2911524, 3846612, 5019520, 6476340, 8269560, 10458630, 13110552, 16300494, 20112428, 24639792, 29986176, 36266032, 43605408, 52142706

Offset: 1

Eric W. Weisstein, Aug 10 2017

Eric Weisstein's World of Mathematics, Graph Cycle
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

Cf. A034827 (3-cycles in the triangular honeycomb bishop graph), A051843 (4-cycles), A290779 (6-cycles).

Table[2/5 Binomial[n + 1, 4] (8 - 7 n + 2 n^2), {n, 20}]
LinearRecurrence[{7, -21, 35, -35, 21, -7, 1}, {0, 0, 2, 24, 138, 532, 1596}, 20]
CoefficientList[Series[-((2 (x^2 + 5 x^3 + 6 x^4))/(-1 + x)^7), {x, 0, 20}], x]

a(n)=n*(2*n^5 - 11*n^4 + 20*n^3 - 5*n^2 - 22*n + 16)/60 \\ Charles R Greathouse IV, Aug 10 2017

a(n) = 2/5 * binomial(n + 1, 4)*(8 - 7*n + 2*n^2).
a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7).
G.f.: -((2 x (x^2 + 5 x^3 + 6 x^4))/(-1 + x)^7).

A290779 Number of 6-cycles in the n-triangular honeycomb bishop graph.

Original entry on oeis.org

0, 0, 1, 57, 486, 2360, 8394, 24354, 61104, 137412, 283635, 546403, 994422, 1725516, 2875028, 4625700, 7219152, 10969080, 16276293, 23645709, 33705430, 47228016, 65154078, 88618310, 118978080, 157844700, 207117495, 269020791, 346143942, 441484516, 558494760

Offset: 1

Eric W. Weisstein, Aug 10 2017

Eric Weisstein's World of Mathematics, Graph Cycle
Index entries for linear recurrences with constant coefficients, signature (8,-28,56,-70,56,-28,8,-1).

Cf. A034827 (3-cycles), A051843 (4-cycles), A290775 (5-cycles).

Table[Binomial[n + 1, 4] (-62 + 11 n - 109 n^2 + 40 n^3)/70, {n, 20}]
LinearRecurrence[{8, -28, 56, -70, 56, -28, 8, -1}, {0, 0, 1, 57, 486, 2360, 8394, 24354}, 40]
CoefficientList[Series[(x^2 + 49 x^3 + 58 x^4 + 12 x^5)/(-1 + x)^8, {x, 0, 20}], x]

a(n)=n*(40*n^6 - 189*n^5 + 189*n^4 + 105*n^3 - 105*n^2 + 84*n - 124)/1680 \\ Charles R Greathouse IV, Aug 10 2017

a(n) = binomial(n + 1, 4)*(-62 + 11*n - 109*n^2 + 40*n^3)/70.
a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8).
G.f.: (x (x^2 + 49 x^3 + 58 x^4 + 12 x^5))/(-1 + x)^8.

A326260 MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed).

Original entry on oeis.org

2599, 4163, 5198, 6463, 6893, 7291, 7797, 8326, 8507, 9131, 9959, 10396, 10649, 11041, 11639, 12489, 12811, 12926, 12995, 13786, 14237, 14582, 14899, 15157, 15594, 16123, 16403, 16652, 17014, 17063, 17089, 17141, 18101, 18193, 18262, 18643, 18659, 19337, 19389

Offset: 1

Gus Wiseman, Jun 22 2019

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The multiset multisystem with MM-number n is obtained by taking the multiset of prime indices of each prime index of n.

A set partition is capturing if it has two blocks of the form {...x...y...} and {...z...t...} where x < z and y > t or x > z and y < t. It is nesting if it has two blocks of the form {...x,y...} and {...z,t...} where x < z and y > t or x > z and y < t. Capturing is a weaker condition than nesting, so for example {{1,3,5},{2,4}} is capturing but not nesting.

			The sequence of terms together with their multiset multisystems begins:
   2599: {{2,2},{1,2,3}}
   4163: {{2,2},{1,2,4}}
   5198: {{},{2,2},{1,2,3}}
   6463: {{2,2},{1,1,2,3}}
   6893: {{1,2,2},{1,2,3}}
   7291: {{2,2},{1,2,5}}
   7797: {{1},{2,2},{1,2,3}}
   8326: {{},{2,2},{1,2,4}}
   8507: {{2,3},{1,2,4}}
   9131: {{2,2},{1,2,6}}
   9959: {{2,2},{1,1,2,4}}
  10396: {{},{},{2,2},{1,2,3}}
  10649: {{2,2},{1,2,2,3}}
  11041: {{1,2,2},{1,2,4}}
  11639: {{2,2,2},{1,2,3}}
  12489: {{1},{2,2},{1,2,4}}
  12811: {{2,2},{1,2,7}}
  12926: {{},{2,2},{1,1,2,3}}
  12995: {{2},{2,2},{1,2,3}}
  13786: {{},{1,2,2},{1,2,3}}

Non-nesting set partitions are A000108.
Capturing set partitions are A326243.
Capturing, non-nesting set partitions are A326249.
MM-numbers of nesting multiset partitions are A326256.
MM-numbers of capturing multiset partitions are A326255.
Cf. A001055, A034827, A056239, A058681, A112798, A117662, A302242, A324170.
Cf. A326212, A326246, A054391, A326257, A326258, A326259.

capXQ[stn_]:=MatchQ[stn,{_,{_,x_,_,y_,_},_,{_,z_,_,t_,_},_}/;x_,{_,x_,y_,_},_,{_,z_,t_,_},_}/;xTable[PrimePi[p],{k}]]]];
Select[Range[10000],!nesXQ[primeMS/@primeMS[#]]&&capXQ[primeMS/@primeMS[#]]&]

Previous Showing 11-20 of 27 results. Next

cp's OEIS Frontend

A326257 MM-numbers of weakly nesting multiset partitions.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A051843 Partial sums of A002419.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A206817 Sum_{0

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Sage

Formula

A033486 a(n) = n*(n + 1)*(n + 2)*(n + 3)/2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A155856 Triangle T(n,k) = binomial(2*n-k, k)*(n-k)!, read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Sage

Formula

A080159 Triangular array of ways of drawing k non-intersecting chords between n points on a circle; i.e., Motzkin polynomial coefficients.

Views

Author

Keywords

Examples

Crossrefs

Formula

A190909 Triangle read by rows: T(n,k) = binomial(n+k,n-k) * k! / floor(k/2)!^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

A033486 a(n) = n(n + 1)(n + 2)*(n + 3)/2.

A155856 Triangle T(n,k) = binomial(2n-k, k)(n-k)!, read by rows.