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.

Showing 1-8 of 8 results.

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

Original entry on oeis.org

2, 4, 7, 13, 26, 52, 103, 205, 410, 820, 1639, 3277, 6554, 13108, 26215, 52429, 104858, 209716, 419431, 838861, 1677722, 3355444, 6710887, 13421773, 26843546, 53687092, 107374183, 214748365, 429496730, 858993460, 1717986919, 3435973837
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 1 of A262274.

Examples

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

Crossrefs

Cf. A262274.

Formula

Empirical: a(n) = 3*a(n-1) - 3*a(n-2) + 3*a(n-3) - 2*a(n-4).
Conjectures from Colin Barker, Feb 21 2018: (Start)
G.f.: x*(2 - 2*x + x^2 - 2*x^3) / ((1 - x)*(1 - 2*x)*(1 + x^2)).
a(n) = 1/2 + 2^(2+n)/5 - (1/20-i/20)*((1+2*i)*(-i)^n + (2+i)*i^n) where i=sqrt(-1).
(End)

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

Original entry on oeis.org

4, 16, 49, 169, 676, 2704, 10609, 42025, 168100, 672400, 2686321, 10738729, 42954916, 171819664, 687226225, 2748800041, 10995200164, 43980800656, 175922363761, 703687777321, 2814751109284, 11259004437136, 45036004326769
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Examples

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

Crossrefs

Column 2 of A262274.

Formula

Empirical: a(n) = 6*a(n-1) - 12*a(n-2) + 24*a(n-3) - 31*a(n-4) - 6*a(n-5) + 12*a(n-6) - 24*a(n-7) + 32*a(n-8).
Empirical g.f.: x*(4 - 8*x + x^2 - 29*x^3 - 10*x^4 + 20*x^5 + 8*x^6 + 32*x^7) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 - 4*x)*(1 + x^2)*(1 + 4*x^2)). - Colin Barker, Dec 31 2018

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

Original entry on oeis.org

7, 49, 149, 585, 3639, 23977, 129481, 762529, 4977703, 33121201, 212297621, 1392648681, 9394847463, 63791220457, 431043859993, 2933293326289, 20157021722983, 138871827073201, 957160775849621, 6614231267870601
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 3 of A262274.

Examples

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

Crossrefs

Cf. A262274.

Formula

Empirical: a(n) = 7*a(n-1) +2438*a(n-4) -17066*a(n-5) -2193828*a(n-8) +15356796*a(n-9) +1012143986*a(n-12) -7085007902*a(n-13) -274571219965*a(n-16) +1921998539755*a(n-17) +46824231026412*a(n-20) -327769617184884*a(n-21) -5180403909036816*a(n-24) +36262827363257712*a(n-25) +375348133713055716*a(n-28) -2627436935991390012*a(n-29) -17669998041050990187*a(n-32) +123689986287356931309*a(n-33) +526338150774349790590*a(n-36) -3684367055420448534130*a(n-37) -9412502562578384921036*a(n-40) +65887517938048694447252*a(n-41) +91478334812736629058378*a(n-44) -640348343689156403408646*a(n-45) -389202483948737967210263*a(n-48) +2724417387641165770471841*a(n-49) +306627613331565950494576*a(n-52) -2146393293320961653462032*a(n-53)

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

Original entry on oeis.org

13, 169, 585, 3253, 37061, 467065, 4403641, 49793329, 628659565, 8114855785, 100698388425, 1284102518917, 16612868083733, 215733029771449, 2784755393197465, 36096259647083761, 468882349083176077
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 4 of A262274.

Examples

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

Crossrefs

Cf. A262274.

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

Original entry on oeis.org

26, 676, 3639, 37061, 828152, 20331508, 411861253, 9709537177, 246785045498, 6349411267540, 161629359993567, 4164579496141613, 107965656860611016, 2802803758993454068, 72720752693665757869, 1888876988979450269185
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 5 of A262274.

Examples

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

Crossrefs

Cf. A262274.

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

Original entry on oeis.org

52, 2704, 23977, 467065, 20331508, 1002110608, 41261408089, 1965295140265, 100013594816980, 5157201006399760, 263679548424381769, 13615797474906740569, 706318618109394294196, 36687081176072230888336
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 6 of A262274.

Examples

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

Crossrefs

Cf. A262274.

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

Original entry on oeis.org

103, 10609, 129481, 4403641, 411861253, 41261408089, 3605017226155, 349760937840517, 35889961902343951, 3691924453378494385, 377481144200284897993, 38754821017971389203489, 3991173847744285567358317
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Column 7 of A262274.

Examples

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

Crossrefs

Cf. A262274.

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

Original entry on oeis.org

2, 16, 149, 3253, 828152, 1002110608, 3605017226155
Offset: 1

Views

Author

R. H. Hardin, Sep 17 2015

Keywords

Comments

Diagonal of A262274.

Examples

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

Crossrefs

Cf. A262274.
Showing 1-8 of 8 results.