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-15 of 15 results.

A057969 5 x n binary matrices without unit columns up to row and column permutations.

Original entry on oeis.org

1, 5, 24, 115, 551, 2542, 11193, 46547, 182164, 670476, 2325506, 7624434, 23716419, 70253721, 198905506, 540079754, 1410786483, 3555443969, 8667153126, 20484365167, 47037898503, 105143200252, 229178029000
Offset: 0

Views

Author

Vladeta Jovovic, Oct 20 2000

Keywords

Comments

A unit column of a binary matrix is a column with only one 1. First differences of a(n) give number of minimal 5-covers of an unlabeled n-set that cover 5 points of that set uniquely (if offset is 5).

Links

Crossrefs

Cf. A001752, A056885, A057222, A057223, A057524, A057669, A057963-A057968, A057970-A057972.

Formula

a(n)=(1/5!)*(Z(S_n; 27, 27, ...) + 10*Z(S_n; 13, 27, 13, 27, ...) + 15*Z(S_n; 7, 27, 7, 27, ...) + 20*Z(S_n; 6, 6, 27, 6, 6, 27, ...) + 20*Z(S_n; 4, 6, 13, 6, 4, 27, 4, 6, 13, 6, 4, 27, ...) + 30*Z(S_n; 3, 7, 3, 27, 3, 7, 3, 27, ...) + 24*Z(S_n; 2, 2, 2, 2, 27, 2, 2, 2, 2, 27, ...)), where Z(S_n; x_1, x_2, ..., x_n) is cycle index of symmetric group S_n of degree n.
G.f. : 1/120*(1/(1 - x^1)^27 + 10/(1 - x^1)^13/(1 - x^2)^7 + 15/(1 - x^1)^7/(1 - x^2)^10 + 20/(1 - x^1)^6/(1 - x^3)^7 + 20/(1 - x^1)^4/(1 - x^2)^1/(1 - x^3)^3/(1 - x^6)^2 + 30/(1 - x^1)^3/(1 - x^2)^2/(1 - x^4)^5 + 24/(1 - x^1)^2/(1 - x^5)^5).

A057970 5 x n binary matrices with 1 unit column up to row and column permutations.

Original entry on oeis.org

1, 8, 54, 333, 1896, 9874, 47164, 207112, 840323, 3168506, 11170331, 37034409, 116095018, 345785753, 982835676, 2676217504, 7005306389, 17681946594, 43153532167, 102080966243, 234565062960, 524594120393, 1143910860870
Offset: 1

Views

Author

Vladeta Jovovic, Oct 21 2000

Keywords

Comments

A unit column of a binary matrix is a column with only one 1. First differences of a(n) give number of minimal 5 - covers of an unlabeled n - set that cover 6 points of that set uniquely (if offset is 6).

Links

Crossrefs

Cf. A001752, A056885, A057222, A057223, A057524, A057669, A057963 - A057968, A057970 - A057972, A057969, A057971, A057972.

Formula

Number of 5 x n binary matrices with k unit columns up to row and column permutations is coefficient of x^k in (1/5!)*(Z(S_n; 27 + 5*x, 27 + 5*x^2, ...) + 10*Z(S_n; 13 + 3*x, 27 + 5*x^2, 13 + 3*x^3, 27 + 5*x^4, ...) + 15*Z(S_n; 7 + x, 27 + 5*x^2, 7 + x^3, 27 + 5*x^4, ...) + 20*Z(S_n; 6 + 2*x, 6 + 2*x^2, 27 + 5*x^3, 6 + 2*x^4, 6 + 2*x^5, 27 + 5*x^6, ...) + 20*Z(S_n; 4, 6 + 2*x^2, 13 + 3*x^3, 6 + 2*x^4, 4, 27 + 5*x^6, 4, 6 + 2*x^8, 13 + 3*x^9, 6 + 2*x^10, 4, 27 + 5*x^12, ...) + 30*Z(S_n; 3 + x, 7 + x^2, 3 + x^3, 27 + 5*x^4, 3 + x^5, 7 + x^6, 3 + x^7, 27 + 5*x^8, ...) + 24*Z(S_n; 2, 2, 2, 2, 27 + 5*x^5, 2, 2, 2, 2, 27 + 5*x^10, ...)), where Z(S_n; x_1, x_2, ..., x_n) is cycle index of symmetric group S_n of degree n.
G.f.: x/120*(5/(1 - x^1)^27 + 30/(1 - x^1)^13/(1 - x^2)^7 + 15/(1 - x^1)^7/(1 - x^2)^10 + 40/(1 - x^1)^6/(1 - x^3)^7 + 30/(1 - x^1)^3/(1 - x^2)^2/(1 - x^4)^5).

A139672 Convolution of A008619 and A001400.

Original entry on oeis.org

1, 2, 5, 9, 17, 27, 44, 65, 97, 136, 191, 257, 346, 451, 587, 746, 946, 1177, 1461, 1786, 2178, 2623, 3151, 3746, 4443, 5223, 6126, 7131, 8283, 9558, 11007, 12603, 14403, 16377, 18588, 21003, 23692, 26618, 29858, 33372, 37244, 41430, 46022, 50972
Offset: 1

Views

Author

Alford Arnold, Apr 29 2008, May 01 2008

Keywords

Comments

This is row 21 of a table of values related to Molien series. It is the product of the sequence on row 3 (A008619) with the sequence on row 7 (A001400).
This table may be constructed by moving the rows of table A008284 to prime locations and generating the composite locations by multiplication in a manner similar to the calculation illustrated in the present sequence.
Rows 1 thru 20 and 22 thru 25 are as follows:
A000012 A008619 A000027 A001399 A002620 A001400 A000217 A006918 A000601 A001401 A002623 A001402 A002621 A097701 A000292 A008630 A002624 A008631 A057524 A002622 A008632 A001752 A117485.

Links

Programs

  • Maple
    a:= proc(n) local m, r; m:= iquo (n, 12, 'r'); r:= r+1; (19+ (145+ (260+ 15* (r+9)*r+ (405+ 90*r+ 216*m) *m) *m) *m) *m/5+ [0, 1, 2, 5, 9, 17, 27, 44, 65, 97, 136, 191][r]+ [0, 16, 37, 77, 128, 208, 307, 447, 616, 840, 1105, 1441][r]*m/2+ [0, 52, 119, 213, 328, 476, 651, 865, 1112, 1404, 1735, 2117][r]*m^2/2 end: seq (a(n), n=1..50); # Alois P. Heinz, Nov 10 2008
  • Mathematica
    CoefficientList[Series[x/((x^2+x+1)(x^2+1)(x+1)^3 (x-1)^6),{x,0,50}],x] (* or *) LinearRecurrence[{2,1,-3,0,-1,2,2,-1,0,-3,1,2,-1},{0,1,2,5,9,17,27,44,65,97,136,191,257},50] (* Harvey P. Dale, Feb 17 2016 *)

Formula

G.f.: x/((x^2+x+1)*(x^2+1)*(x+1)^3*(x-1)^6). - Alois P. Heinz, Nov 10 2008
a(n)= -A049347(n)/27 +(2*n+11)*(6*n^4+132*n^3+914*n^2+2068*n+1055)/69120 -(-1)^n*(51/512+n^2/256+11*n/256+A057077(n)/32 ). - R. J. Mathar, Nov 21 2008

Extensions

More terms from Alois P. Heinz, Nov 10 2008
Corrected A-number in definition. Added formula. - R. J. Mathar, Nov 21 2008

A057971 Number of 5 x n binary matrices with 2 unit columns up to row and column permutations.

Original entry on oeis.org

2, 18, 133, 873, 5182, 27786, 135370, 602454, 2466628, 9358497, 33134431, 110184932, 346141949, 1032550097, 2938104492, 8006865684, 20971632456, 52958252851, 129291697111, 305924724070, 703108665327, 1572722761341
Offset: 2

Views

Author

Vladeta Jovovic, Oct 21 2000

Keywords

Comments

A unit column of a binary matrix is a column with only one 1. First differences of a(n) give number of minimal 5 - covers of an unlabeled n - set that cover 7 points of that set uniquely (if offset is 7).

Links

Crossrefs

Cf. A001752, A056885, A057222, A057223, A057524, A057669, A057963-A057968, A057970-A057972, A057969, A057970, A057972.

Formula

Number of 5 x n binary matrices with k unit columns up to row and column permutations is coefficient of x^k in (1/5!)*(Z(S_n; 27 + 5*x, 27 + 5*x^2, ...) + 10*Z(S_n; 13 + 3*x, 27 + 5*x^2, 13 + 3*x^3, 27 + 5*x^4, ...) + 15*Z(S_n; 7 + x, 27 + 5*x^2, 7 + x^3, 27 + 5*x^4, ...) + 20*Z(S_n; 6 + 2*x, 6 + 2*x^2, 27 + 5*x^3, 6 + 2*x^4, 6 + 2*x^5, 27 + 5*x^6, ...) +
20*Z(S_n; 4, 6 + 2*x^2, 13 + 3*x^3, 6 + 2*x^4, 4, 27 + 5*x^6, 4, 6 + 2*x^8, 13 + 3*x^9, 6 + 2*x^10, 4, 27 + 5*x^12, ...) + 30*Z(S_n; 3 + x, 7 + x^2, 3 + x^3, 27 + 5*x^4, 3 + x^5, 7 + x^6, 3 + x^7, 27 + 5*x^8, ...) + 24*Z(S_n; 2, 2, 2, 2, 27 + 5*x^5, 2, 2, 2, 2, 27 + 5*x^10, ...)),
where Z(S_n; x_1, x_2, ..., x_n) is cycle index of symmetric group S_n of degree n.
G.f.: x^2/120*(15/(1 - x^1)^27 + 70/(1 - x^1)^13/(1 - x^2)^7 + 45/(1 - x^1)^7/(1 - x^2)^10 + 60/(1 - x^1)^6/(1 - x^3)^7 + 20/(1 - x^1)^4/(1 - x^2)^1/(1 - x^3)^3/(1 - x^6)^2 + 30/(1 - x^1)^3/(1 - x^2)^2/(1 - x^4)^5).

A275779 a(n) = (2^(n^2) - 1)/(1 - 1/2^n).

Original entry on oeis.org

2, 20, 584, 69904, 34636832, 69810262080, 567382630219904, 18519084246547628288, 2422583247133816584929792, 1268889750375080065623288448000, 2659754699919401766201267083003561984, 22306191045953951743035482794815064402563072
Offset: 1

Views

Author

Olivier Gérard, Aug 08 2016

Keywords

Comments

Sum of the geometric progression of ratio 2^n.
Number of all partial binary matrices with rows of length n: A partial binary matrix has 1<=k<=n rows of length n. The number of different partial matrices with k rows is 2^(k*n). a(n) is the sum for k between 1 and n.

Links

Crossrefs

Cf. A128889 (accepting the null matrix and excluding the full n*n matrices)
Cf. A096131, A057524.

Programs

  • Mathematica
    Table[(2^(n^2) - 1)/(1 - 1/2^n), {n, 1, 10}]
  • PARI
    a(n) = {(2^(n^2) - 1)/(1 - 1/2^n)} \\ Andrew Howroyd, Apr 26 2020

Formula

a(n) = Sum_{k=1..n} 2^(k*n).

Extensions

Terms a(11) and beyond from Andrew Howroyd, Apr 26 2020
Previous Showing 11-15 of 15 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.