A002623 -id:A002623 - cp's OEIS frontend

A175724 Partial sums of floor(n^2/12).

0, 0, 0, 0, 1, 3, 6, 10, 15, 21, 29, 39, 51, 65, 81, 99, 120, 144, 171, 201, 234, 270, 310, 354, 402, 454, 510, 570, 635, 705, 780, 860, 945, 1035, 1131, 1233, 1341, 1455, 1575, 1701, 1834, 1974, 2121, 2275, 2436, 2604, 2780, 2964, 3156, 3356

Offset: 0

Mircea Merca, Aug 18 2010

Partial sums of A008724.

Maximum Wiener index of all maximal 6-degenerate graphs with n-2 vertices. (A maximal 6-degenerate graph can be constructed from a 6-clique by iteratively adding a new 6-leaf (vertex of degree 6) adjacent to 6 existing vertices.) The extremal graphs are 6th powers of paths, so the bound also applies to 6-trees. - Allan Bickle, Sep 18 2022

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Allan Bickle and Zhongyuan Che, Wiener indices of maximal k-degenerate graphs, arXiv:1908.09202 [math.CO], 2019.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
Mircea Merca, Inequalities and Identities Involving Sums of Integer Functions J. Integer Sequences, Vol. 14 (2011), Article 11.9.1.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1,0,0,1,-3,3,-1).

Cf. A008724.

Maximum Wiener index of all maximal k-degenerate graphs for k=1..6: A000292, A002623, A014125, A122046, A122047, (this sequence).

[ &+[ Floor(j^2/12): j in [0..n] ]: n in [0..60] ];

A175724 := proc(n) add( floor(i^2/12) ,i=0..n) ; end proc:

Mathematica
```
Accumulate[Floor[Range[0, 49]^2/12]]
```

vector(61, n, round((2*(n-1)^3 +3*(n-1)^2 -18*(n-1))/72) ) \\ G. C. Greubel, Dec 05 2019

[round((2*n^3 +3*n^2 -18*n)/72) for n in (0..60)] # G. C. Greubel, Dec 05 2019

a(n) = round((2*n^3 + 3*n^2 - 18*n)/72).
a(n) = a(n-6) + (n-2)*(n-3)/2, n>5.
a(n) = 3*a(n-1) -3*a(n-2) +a(n-3) +a(n-6) -3*a(n-7) +3*a(n-8) -a(n-9), n>8.
G.f.: x^4/((x+1)*(x^2+x+1)*(x^2-x+1)*(x-1)^4).
An explicit formula appears in the Bickle/Che paper.

A247588 Number of integer-sided acute triangles with largest side n.

Original entry on oeis.org

1, 2, 3, 5, 6, 8, 11, 13, 15, 17, 21, 25, 27, 31, 34, 39, 43, 48, 52, 56, 63, 67, 73, 80, 84, 90, 96, 104, 111, 117, 126, 132, 140, 147, 154, 165, 172, 183, 189, 198, 210, 219, 229, 237, 247, 260, 270, 282, 292, 302

Offset: 1

Vladimir Letsko, Sep 20 2014

nonn

			a(3) = 3 because there are 3 integer-sided acute triangles with largest side 3: (1,3,3); (2,3,3); (3,3,3).

Vladimir Letsko, Mathematical Marathon, problem 192 (in Russian).

Cf. A046080, A002623, A224921, A247586, A247587, A247589.

tr_a:=proc(n) local a,b,t,d;t:=0:
for a to n do
for b from max(a,n+1-a) to n do
d:=a^2+b^2-n^2:
if d>0 then t:=t+1 fi
od od;
t; end;

a[ n_] := Length @ FindInstance[ n >= b >= a >= 1 && n < b + a && n^2 < b^2 + a^2, {a, b}, Integers, 10^9]; (* Michael Somos, May 24 2015 *)

a(n) = sum(j=0, n*(1 - sqrt(2)/2), n - j - floor(sqrt(2*j*n - j^2))); \\ Michel Marcus, Oct 07 2014

{a(n) = sum(j=0, n - sqrtint(n*n\2) - 1, n - j - sqrtint(2*j*n - j*j))}; /* Michael Somos, May 24 2015 */

a(n) = Sum_{j=0..floor(n*(1 - sqrt(2)/2))} (n - j - floor(sqrt(2*j*n - j^2))). - Anton Nikonov, Oct 06 2014

a(n) = (1/8)*(-4*ceiling((n - 1)/sqrt(2)) + 4*n^2 - A000328(n) + 1), n > 1. - Mats Granvik, May 23 2015

A001779 Expansion of 1/((1+x)(1-x)^8).

Original entry on oeis.org

1, 7, 29, 91, 239, 553, 1163, 2269, 4166, 7274, 12174, 19650, 30738, 46782, 69498, 101046, 144111, 201993, 278707, 379093, 508937, 675103, 885677, 1150123, 1479452, 1886404, 2385644, 2993972

Offset: 0

N. J. A. Sloane

a(n) is the number of positive terms in the expansion of (a_1 + a_2 + a_3 + a_4 + a_5 + a_6 + a_7 - z)^n. Also the convolution of A001769 and A000012; A001753 and A001477; A001752 and A000217; A002623 and A000292; A002620 and A000332; A004526 and A000389. - Sergio Falcon (sfalcon(AT)dma.ulpgc.es), Feb 13 2007

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (7,-20,28,-14,-14,28,-20,7,-1).

Cf. A001769 (first differences), A169795 (binomial transf.)

[1/80640*(2*n+9) *(4*n^6 +108*n^5 +1138*n^4 +5904*n^3 +15628*n^2 +19638*n +8925)+(-1)^n/256 : n in [0..30]]; // Vincenzo Librandi, Oct 08 2011

A001779 := proc(n) 1/80640*(2*n+9) *(4*n^6 +108*n^5 +1138*n^4 +5904*n^3 +15628*n^2 +19638*n +8925)+(-1)^n/256 ; end proc:
seq(A001779(n),n=0..50) ; # R. J. Mathar, Mar 22 2011

CoefficientList[Series[1/((1 + x) (1 - x)^8), {x, 0, 50}], x] (* G. C. Greubel, Nov 24 2017 *)
LinearRecurrence[{7,-20,28,-14,-14,28,-20,7,-1},{1,7,29,91,239,553,1163,2269,4166},30] (* Harvey P. Dale, Jan 21 2023 *)

a(n)=(2*n+9)*(4*n^6+108*n^5+1138*n^4+5904*n^3+15628*n^2+19638*n + 8925)/80640 +(-1)^n/256 \\ Charles R Greathouse IV, Apr 17 2012

a(n) = (-1)^{7-n}*Sum_{i=0..n} ((-1)^(7-i)*binomial(7+i,i)). - Sergio Falcon, Feb 13 2007

a(n)+a(n+1) = A000580(n+8). - R. J. Mathar, Jan 06 2021

A164680 Expansion of x/((1-x)^3(1-x^2)^3(1-x^3)).

Original entry on oeis.org

1, 3, 9, 20, 42, 78, 139, 231, 372, 573, 861, 1254, 1791, 2499, 3432, 4629, 6162, 8085, 10492, 13455, 17094, 21503, 26832, 33201, 40795, 49764, 60333, 72687, 87096, 103785, 123075, 145236, 170646, 199626, 232617, 269997, 312277, 359898, 413448, 473438

Offset: 1

Alford Arnold, Aug 21 2009

Convolution of A006918 with A001399, or of A002625 with A059841 (A000035 if offsets are respected),
or of A038163 with A022003 or of A057524 with A027656 or of A014125 with the aerated version of A000217,
or of A002624 with A103221, or of A002623 with A008731, or of other combinations of splitting the signature -/3,3,1 into two components.
If we apply the enumeration of Molien series as described in A139672,
this is row 45=9*5 of a table of values related to Molien series, i.e., the
product of the sequence on row 9 (A006918) with the sequence on row 5 (A001399).
This is associated with the root system E6, and can be described using the additive function on the affine E6 diagram:
      1
      |
      2
      |
1--2--3--2--1

			To calculate a(3), we consider the first three terms of A001399 = (1 1 2...)
and the first three terms of A006918 = (1 2 5 ...), to get the convolved a(3) = 1*5+1*2+2*1 = 9.

G. C. Greubel, Table of n, a(n) for n = 1..1000
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (3,0,-7,3,6,0,-6,-3,7,0,-3,1).

Cf. A139672 (row 21).
For G2, the corresponding sequence is A001399.
For F4, the corresponding sequence is A115264.
For E7, the corresponding sequence is A210068.
For E8, the corresponding sequence is A045513.
See A210634 for a closely related sequence.

R:=PowerSeriesRing(Integers(), 40); Coefficients(R!( 1/((1-x)^3*(1-x^2)^3*(1-x^3)) )); // G. C. Greubel, Jan 13 2020

seq(coeff(series(x/((1-x)^3*(1-x^2)^3*(1-x^3)), x, n+1), x, n), n = 1..40); # G. C. Greubel, Jan 13 2020

Rest@CoefficientList[Series[x/((1-x)^3*(1-x^2)^3*(1-x^3)), {x,0,40}], x] (* G. C. Greubel, Jan 13 2020 *)
LinearRecurrence[{3,0,-7,3,6,0,-6,-3,7,0,-3,1},{1,3,9,20,42,78,139,231,372,573,861,1254},40] (* Harvey P. Dale, Aug 03 2025 *)

Vec(1/(1-x)^3/(1-x^2)^3/(1-x^3)+O(x^40)) \\ Charles R Greathouse IV, Sep 23 2012

x=PowerSeriesRing(QQ, 'x', 40).gen()
1/((1-x)^3*(1-x^2)^3*(1-x^3))

a(n) = round( -(-1)^n*(n+3)*(n+7)/256 +(6*n^6 +180*n^5 +2070*n^4 +11400*n^3 +30429*n^2 +34290*n +9785)/103680 ) - R. J. Mathar, Mar 19 2012

Edited and extended by R. J. Mathar, Aug 22 2009

Corrected link to index entries - R. J. Mathar, Aug 26 2009

A266362 T(n,k) = Number of n X k binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.

Original entry on oeis.org

2, 3, 3, 4, 7, 4, 5, 13, 13, 5, 6, 22, 35, 22, 6, 7, 34, 82, 82, 34, 7, 8, 50, 173, 276, 173, 50, 8, 9, 70, 337, 830, 830, 337, 70, 9, 10, 95, 614, 2278, 3669, 2278, 614, 95, 10, 11, 125, 1060, 5752, 14921, 14921, 5752, 1060, 125, 11, 12, 161, 1749, 13525, 55734, 93085

Offset: 1

R. H. Hardin, Dec 28 2015

Table starts
..2...3....4.....5.......6........7..........8..........9.........10.........11
..3...7...13....22......34.......50.........70.........95........125........161
..4..13...35....82.....173......337........614.......1060.......1749.......2777
..5..22...82...276.....830.....2278.......5752......13525......29864......62455
..6..34..173...830....3669....14921......55734.....191916.....612871....1827072
..7..50..337..2278...14921....93085.....541207....2909244...14424728...66153106
..8..70..614..5752...55734...541207....5061414...44435916..361401441.2711340372
..9..95.1060.13525..191916..2909244...44435916..654427939.9043864160
.10.125.1749.29864..612871.14424728..361401441.9043864160
.11.161.2777.62455.1827072.66153106.2711340372

			Some solutions for n=4, k=4
..0..0..0..1....0..0..0..1....0..0..1..1....0..0..1..1....0..0..0..0
..0..0..1..1....0..0..0..1....0..1..0..1....0..1..1..1....0..0..0..1
..0..1..1..0....1..1..1..0....0..1..1..1....1..1..0..1....0..1..1..0
..1..0..0..1....1..1..1..0....1..1..1..0....1..1..1..1....0..1..1..1

R. H. Hardin, Table of n, a(n) for n = 1..143

Column 1 is A000027(n+1).

Column 2 is A002623.

Empirical for column k:
k=1: a(n) = 2*a(n-1) -a(n-2);
k=2: a(n) = 3*a(n-1) -2*a(n-2) -2*a(n-3) +3*a(n-4) -a(n-5);
k=3: a(n) = 5*a(n-1) -9*a(n-2) +6*a(n-3) -6*a(n-7) +9*a(n-8) -5*a(n-9) +a(n-10).

A292265 A multiplicative encoding (compressed) for the exponents of 2 obtained when using Shevelev's algorithm for computing A002326.

Original entry on oeis.org

2, 3, 12, 6, 20, 180, 720, 5, 80, 25920, 20, 360, 43200, 25920, 6220800, 10, 240, 540, 671846400, 540, 57600, 2160, 540, 194400, 155520, 45, 5804752896000, 77760, 14400, 87071293440000, 348285173760000, 15, 960, 12538266255360000, 311040, 139968000, 120, 77760, 18662400, 1679616000, 23219011584000, 108330620446310400000, 60, 4665600, 360, 540, 180

Offset: 0

Antti Karttunen, Oct 02 2017

nonn

a(n) = A019565(v(1)) * A019565(v(2)) * ... * A019565(v(k)), where v(1) .. v(k) are 2-adic valuations (not all necessarily distinct) of the iterated values obtained when running Shevelev's algorithm for computing A002623. (See A179680 and A292239.)

Antti Karttunen, Table of n, a(n) for n = 0..1023

Cf. A000265, A002326, A007814, A019565, A179680, A292239 (a variant), A292266 (rgs-version of this filter).

A000265(n) = (n >> valuation(n, 2));
A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler
A292265(n) = { my(x = n+n+1, z = A019565(valuation(1+x,2)), m = A000265(1+x)); while(m!=1, z *= A019565(valuation(x+m,2)); m = A000265(x+m)); z; };

(define (A292265 n) (let ((x (+ n n 1))) (let loop ((z (A019565 (A007814 (+ 1 x)))) (k 1)) (let ((m (A000265 (+ x k)))) (if (= 1 m) z (loop (* z (A019565 (A007814 (+ x m)))) m))))))

For all n >= 0, A048675(a(n)) = A002326(n).

A002725 Number of incidence matrices: n X (n+1) binary matrices under row and column permutations.

Original entry on oeis.org

1, 3, 13, 87, 1053, 28576, 2141733, 508147108, 402135275365, 1073376057490373, 9700385489355970183, 298434346895322960005291, 31479360095907908092817694945, 11474377948948020660089085281068730, 14568098446466140788730090352230460100956

Offset: 0

N. J. A. Sloane

a(0) = 1 by convention.

			a(1) = 3: [0,0], [0,1], [1,1].
a(2) = 13:
000 000 000 000 001 001 001 001 001 011 011 011 111
000 001 011 111 001 010 011 110 111 011 101 111 111

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 0..50 (terms 0..23 from Alois P. Heinz)
A. Kerber, Experimentelle Mathematik, Séminaire Lotharingien de Combinatoire. Institut de Recherche Math. Avancée, Université Louis Pasteur, Strasbourg, Actes 19 (1988), 77-83. [Annotated scanned copy]
B. Misek, On the number of classes of strongly equivalent incidence matrices, (Czech with English summary) Casopis Pest. Mat. 89 1964 211-218.

Cf. A002623, A002727, A006148, A002728, A002724.

A diagonal of the array A(m,n) described in A028657. - N. J. A. Sloane, Sep 01 2013

b:= proc(n, i) option remember; `if`(n=0, {0}, `if`(i<1, {},
      {seq(map(p-> p+j*x^i, b(n-i*j, i-1))[], j=0..n/i)}))
    end:
a:= n-> add(add(2^add(add(igcd(i, j)* coeff(s, x, i)*
      coeff(t, x, j), j=1..degree(t)), i=1..degree(s))/
      mul(i^coeff(s, x, i)*coeff(s, x, i)!, i=1..degree(s))/
      mul(i^coeff(t, x, i)*coeff(t, x, i)!, i=1..degree(t)),
      t=b(n+1$2)), s=b(n$2)):
seq(a(n), n=0..12);  # Alois P. Heinz, Aug 01 2014

b[n_, i_] := b[n, i] = If[n == 0, {0}, If[i<1, {}, Flatten @ Table[ Map[ Function[ {p}, p+j*x^i], b[n-i*j, i-1]], {j, 0, n/i}]]];
a[n_] := Sum[Sum[2^Sum[ Sum [ GCD[i, j]*Coefficient[s, x, i]*Coefficient[t, x, j], {j, 1, Exponent[t, x]}], {i, 1, Exponent[s, x]}] / Product[ i^Coefficient[s, x, i]*Coefficient[s, x, i]!, {i, 1, Exponent[s, x]}] / Product[i^Coefficient[t, x, i]*Coefficient[t, x, i]!, {i, 1, Exponent[t, x]}], {t, b[n+1, n+1]}], {s,  b[n, n]}];
Table[a[n], {n, 0, 12}] (* Jean-François Alcover, Feb 25 2015, after Alois P. Heinz *)

a(n) = A(n+1,n) \\ A defined in A028657. - Andrew Howroyd, Mar 01 2023

a(n) = sum_{1*s_1+2*s_2+...=n, 1*t_1+2*t_2+...=n+1} (fix A[s_1, s_2, ...; t_1, t_2, ...]/(1^s_1*s_1!*2^s_2*s_2!*...*1^t_1*t_1!*2^t_2*t_2!*...)) where fix A[...] = 2^sum_{i, j>=1} (gcd(i, j)*s_i*t_j). - Sean A. Irvine, Jul 31 2014

More terms from Vladeta Jovovic, Feb 04 2000

A002728 Number of n X (n+2) binary matrices.

Original entry on oeis.org

1, 4, 22, 190, 3250, 136758, 17256831, 7216495370, 10271202313659, 49856692830176512, 826297617412284162618, 46948445432190686211183650, 9200267975562856184153936960940, 6261904454889790650636380541051266410, 14910331834338546882501064075429145637985605

Offset: 0

N. J. A. Sloane

nonn

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 0..50 (terms 0..23 from Alois P. Heinz)
A. Kerber, Experimentelle Mathematik, Séminaire Lotharingien de Combinatoire. Institut de Recherche Math. Avancée, Université Louis Pasteur, Strasbourg, Actes 19 (1988), 77-83. [Annotated scanned copy]
B. Misek, On the number of classes of strongly equivalent incidence matrices, (Czech with English summary) Casopis Pest. Mat. 89 1964 211-218.

Cf. A002623, A002727, A006148, A002724, A002725.

A diagonal of the array A(m,n) described in A028657. - N. J. A. Sloane, Sep 01 2013

b:= proc(n, i) option remember; `if`(n=0, {0}, `if`(i<1, {},
      {seq(map(p-> p+j*x^i, b(n-i*j, i-1) )[], j=0..n/i)}))
    end:
a:= n-> add(add(2^add(add(igcd(i, j)* coeff(s, x, i)*
      coeff(t, x, j), j=1..degree(t)), i=1..degree(s))/
      mul(i^coeff(s, x, i)*coeff(s, x, i)!, i=1..degree(s))/
      mul(i^coeff(t, x, i)*coeff(t, x, i)!, i=1..degree(t)),
      t=b(n+2$2)), s=b(n$2)):
seq(a(n), n=0..12);  # Alois P. Heinz, Aug 01 2014

b[n_, i_] := b[n, i] = If[n == 0, {0}, If[i<1, {}, Table[Function[{p}, p + j*x^i]@ b[n-i*j, i-1] , {j, 0, n/i}]]] // Flatten; a[n_] := Sum[Sum[2^Sum[Sum[GCD[i, j]*Coefficient[s, x, i]*Coefficient[t, x, j], {j, 1, Exponent[t, x]}], {i, 1, Exponent[s, x]}]/Product[i^Coefficient[s, x, i]*Coefficient[s, x, i]!, {i, 1, Exponent[s, x]}]/Product[i^Coefficient[t, x, i]*Coefficient[t, x, i]!, {i, 1, Exponent[t, x]}], {t, b[n+2, n+2]}], {s, b[n, n]}]; Table[a[n], {n, 0, 12}] (* Jean-François Alcover, Nov 28 2014, after Alois P. Heinz *)

a(n) = A(n+2,n) \\ A defined in A028657. - Andrew Howroyd, Mar 01 2023

a(n) = sum {1*s_1+2*s_2+...=n, 1*t_1+2*t_2+...=n+2} (fix A[s_1, s_2, ...;t_1, t_2, ...]/(1^s_1*s_1!*2^s_2*s_2!*...*1^t_1*t_1!*2^t_2*t_2!*...)) where fix A[...] = 2^sum {i, j>=1} (gcd(i, j)*s_i*t_j). - Sean A. Irvine, Jul 31 2014

More terms from Vladeta Jovovic, Feb 04 2000

A005745 Number of n-covers of an unlabeled 3-set.

Original entry on oeis.org

1, 6, 23, 65, 156, 336, 664, 1229, 2159, 3629, 5877, 9221, 14070, 20951, 30530, 43634, 61283, 84725, 115461, 155294, 206368, 271210, 352784, 454550, 580509, 735280, 924163, 1153207, 1429292, 1760218, 2154776, 2622859, 3175555, 3825247

Offset: 1

N. J. A. Sloane, Simon Plouffe

Number of n X 3 binary matrices with at least one 1 in every column up to row and column permutations. - Andrew Howroyd, Feb 28 2023

R. J. Clarke, Covering a set by subsets, Discrete Math., 81 (1990), 147-152.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 1..1000
Vladeta Jovovic, Binary matrices up to row and column permutations

A diagonal of A055080.
First differences give A055609.
Cf. A002623, A002727.
Cf. A005744, A005746, A005747, A005748, A005771.

Vec(G(3, x) - G(2, x) + O(x^40)) \\ G defined in A028657. - Andrew Howroyd, Feb 28 2023

a(n) = A002727(n) - A002623(n).

G.f.: -x*(x^8-x^7-x^6-2*x^5+2*x^4+x^3-3*x^2-2*x-1)/((x^3-1)^2*(x^2-1)^2*(x-1)^4).

More terms from Vladeta Jovovic, May 26 2000

A123324 Number of integer-sided triangles with all sides <= n and sides relatively prime.

Original entry on oeis.org

1, 2, 5, 9, 17, 24, 39, 53, 74, 94, 129, 155, 203, 242, 294, 346, 426, 483, 582, 658, 760, 855, 998, 1098, 1258, 1390, 1561, 1711, 1935, 2083, 2338, 2538, 2788, 3012, 3312, 3534, 3894, 4173, 4521, 4817, 5257, 5551, 6034, 6404, 6848, 7255, 7830, 8222, 8831

Offset: 1

Franklin T. Adams-Watters, Sep 25 2006

Number of triples a,b,c with a<=b<=c

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A002623, A123323, A123325.

A123323[n_] := DivisorSum[n, Floor[(#+1)^2/4]*MoebiusMu[n/#]&]; Array[ A123323, 60] // Accumulate (* Jean-François Alcover, Dec 07 2015 *)

A123323(n)=sum(k=1,n,sumdiv(k,d,floor((d+1)^2/4)*moebius(k/d)));

Partial sums of A123323.

G.f.: (G(x)+x-x^2)/(2(1-x)), where G(x) = Sum_{k >= 1} mobius(k)*x^k*(1+2*x^k-x^(2*k))/(1-x^k)^2/(1-x^(2*k)).

Previous Showing 51-60 of 92 results. Next

cp's OEIS Frontend

A175724 Partial sums of floor(n^2/12).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A247588 Number of integer-sided acute triangles with largest side n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A001779 Expansion of 1/((1+x)(1-x)^8).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A164680 Expansion of x/((1-x)^3*(1-x^2)^3*(1-x^3)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A266362 T(n,k) = Number of n X k binary arrays with rows and columns lexicographically nondecreasing and row and column sums nondecreasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A292265 A multiplicative encoding (compressed) for the exponents of 2 obtained when using Shevelev's algorithm for computing A002326.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Scheme

Formula

A002725 Number of incidence matrices: n X (n+1) binary matrices under row and column permutations.

Views

Author

A164680 Expansion of x/((1-x)^3(1-x^2)^3(1-x^3)).