A262759 -id:A262759 - cp's OEIS frontend

A262753 Number of (n+2) X (2+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

4, 9, 25, 100, 361, 1369, 5476, 21609, 85849, 343396, 1371241, 5480281, 21921124, 87665769, 350625625, 1402502500, 5609860201, 22439141209, 89756564836, 359025060969, 1436097847129, 5744391388516, 22977555967081, 91910204694361

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

			Some solutions for n=4:
..0..1..0..1....1..1..1..1....1..0..1..0....1..0..1..0....1..0..1..0
..0..0..0..0....1..1..1..1....1..0..1..0....1..0..1..0....1..0..1..0
..0..0..0..0....1..0..1..0....1..0..1..0....1..1..1..1....0..1..0..1
..1..0..1..0....1..0..1..0....1..0..1..0....1..1..1..1....0..1..0..1
..1..1..1..1....1..0..1..0....1..0..1..0....1..1..1..1....0..1..0..1
..1..1..1..1....1..1..1..1....1..0..1..0....1..0..1..0....1..0..1..0

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

Column 2 of A262759.

Empirical: a(n) = 4*a(n-1) + 9*a(n-3) - 36*a(n-4) - 8*a(n-6) + 32*a(n-7).

Empirical g.f.: x*(4 - 7*x - 11*x^2 - 36*x^3 + 24*x^4 + 24*x^5 + 32*x^6) / ((1 - x)*(1 - 2*x)*(1 - 4*x)*(1 + x + x^2)*(1 + 2*x + 4*x^2)). - Colin Barker, Dec 31 2018

A262754 Number of (n+2)X(3+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

7, 17, 49, 319, 1345, 6193, 39751, 229841, 1339569, 8663743, 55835745, 358608881, 2379031207, 15973282577, 107339155889, 729414305599, 4997779808385, 34344305727921, 237112117127431, 1643074583243345, 11416088795366577

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Column 3 of A262759.

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

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

Cf. A262759.

A262755 Number of (n+2)X(4+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

13, 37, 129, 1645, 8605, 52993, 658381, 5747701, 51979793, 636258829, 7230695309, 80140442481, 979582061773, 12020681709477, 143857668728353, 1766744698318765, 21995191160679549, 270443634865041121

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Column 4 of A262759.

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

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

Cf. A262759.

A262760 Number of (3+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

5, 25, 49, 129, 709, 4953, 16705, 73345, 384485, 2252185, 9821425, 47556225, 241769125, 1278440025, 6106506625, 30240858625, 152043549125, 774590745625, 3814859880625, 19015880330625, 95252710613125, 479215784705625

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Row 3 of A262759.

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

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

Cf. A262759.

Empirical: a(n) = 5*a(n-1) +290*a(n-4) -1450*a(n-5) -19200*a(n-8) +96000*a(n-9) +370750*a(n-12) -1853750*a(n-13) -1409375*a(n-16) +7046875*a(n-17)

A262761 Number of (4+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

10, 100, 319, 1645, 16450, 243220, 1614175, 15350125, 153501250, 1790228500, 15826009375, 157647278125, 1576472781250, 16543231412500, 159357016609375, 1592677865078125, 15926778650781250, 161625340977812500

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Row 4 of A262759.

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

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

Cf. A262759.

Empirical: a(n) = 15*a(n-1) -75*a(n-2) +375*a(n-3) +2200*a(n-4) -51750*a(n-5) +258750*a(n-6) -1293750*a(n-7) +3016875*a(n-8) +19434375*a(n-9) -97171875*a(n-10) +485859375*a(n-11) -1589281250*a(n-12) -453750000*a(n-13) +2268750000*a(n-14) -11343750000*a(n-15) +37812500000*a(n-16)

A262762 Number of (5+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

19, 361, 1345, 8605, 135595, 3051121, 31840777, 475175089, 7929763795, 150668328169, 2326985790673, 39746065869181, 690182655459499, 12460277987364721, 213488928651534985, 3766549018888748593

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Row 5 of A262759.

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

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

Cf. A262759.

A262752 Number of (n+2) X (n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

2, 9, 49, 1645, 135595, 71515801

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Diagonal of A262759.

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

Cf. A262759.

A262756 Number of (n+2)X(5+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

26, 107, 709, 16450, 135595, 1635877, 37426418, 595006235, 10954392773, 252014772610, 5417495716875, 121326759600741

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Column 5 of A262759.

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

Cf. A262759.

A262757 Number of (n+2) X (6+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

52, 321, 4953, 243220, 3051121, 71515801, 3270912532, 99189450609

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Column 6 of A262759.

			Some solutions for n=3
..0..0..1..0..1..1..0..1....0..0..0..1..0..1..0..0....0..1..0..0..1..0..1..1
..1..0..1..1..1..0..0..1....1..0..0..1..0..1..1..0....1..1..0..0..1..0..0..0
..1..1..1..1..1..1..1..1....1..1..1..1..1..1..1..1....1..1..1..0..1..0..1..1
..1..1..0..1..0..0..1..0....1..1..1..0..1..0..1..1....1..0..1..0..0..0..0..0
..0..1..0..0..0..1..1..0....0..1..1..0..1..0..0..1....0..0..1..0..0..0..1..1

Cf. A262759.

A262758 Number of (n+2)X(7+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Original entry on oeis.org

103, 865, 16705, 1614175, 31840777, 1252506169

Offset: 1

R. H. Hardin, Sep 30 2015

nonn

Column 7 of A262759.

			Some solutions for n=3
..0..0..1..0..0..0..1..1..0....1..0..1..1..0..1..0..0..0
..0..0..0..0..0..0..1..0..1....1..0..0..0..0..0..1..0..0
..1..1..1..1..0..1..1..1..1....1..1..1..1..1..1..1..1..0
..1..1..0..1..0..1..0..0..1....0..1..0..0..1..0..1..1..0
..1..1..1..1..0..1..0..1..0....0..1..1..1..1..1..0..1..0

Cf. A262759.

cp's OEIS Frontend

A262753 Number of (n+2) X (2+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

A262754 Number of (n+2)X(3+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A262755 Number of (n+2)X(4+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A262760 Number of (3+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A262761 Number of (4+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A262762 Number of (5+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A262752 Number of (n+2) X (n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Crossrefs

A262756 Number of (n+2)X(5+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Crossrefs

A262757 Number of (n+2) X (6+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Crossrefs

A262758 Number of (n+2)X(7+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

Views

Author

Keywords

Comments

Examples

Crossrefs