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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
Showing 1-8 of 8 results.
Comments