A263119
Number of (n+3) X (1+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
14, 29, 59, 119, 238, 477, 955, 1911, 3822, 7645, 15291, 30583, 61166, 122333, 244667, 489335, 978670, 1957341, 3914683, 7829367, 15658734, 31317469, 62634939, 125269879, 250539758, 501079517, 1002159035, 2004318071, 4008636142
Offset: 1
Some solutions for n=4:
..0..0..0..0....1..1..1..1....0..0..0..0....0..0..0..0....0..0..0..0
..0..0..0..0....1..1..1..1....1..1..1..1....0..0..0..0....0..0..0..0
..0..0..0..0....1..1..1..1....1..1..1..1....1..1..1..1....1..1..1..1
..0..0..0..0....0..0..0..0....1..1..1..1....0..0..0..0....0..0..0..0
..1..1..1..1....0..0..0..0....0..0..0..0....0..0..0..0....1..1..1..1
..0..0..0..0....1..1..1..1....1..1..1..1....0..0..0..0....1..1..1..1
..0..0..0..0....1..1..1..1....0..0..0..0....1..1..1..1....0..0..0..0
A263120
Number of (n+3)X(2+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
36, 148, 522, 1708, 5124, 15640, 47602, 144236, 432708, 1295524, 3883594, 11649676, 34949028, 104703688, 313818418, 940969804, 2822909412, 8465899188, 25390861962, 76159749740, 228479249220, 685409187320, 2056136698226
Offset: 1
Some solutions for n=4
..1..1..1..1..0....1..1..1..1..0....0..0..0..0..0....0..1..1..1..1
..1..1..1..1..0....0..0..0..0..0....0..1..1..1..1....1..1..1..1..0
..0..0..0..0..0....1..1..1..1..0....0..0..0..0..0....1..1..1..1..0
..0..1..1..1..1....0..1..1..1..1....1..1..1..1..0....0..1..1..1..1
..1..1..1..1..0....0..0..0..0..0....1..1..1..1..0....1..1..1..1..0
..1..1..1..1..0....1..1..1..1..0....0..1..1..1..1....1..1..1..1..0
..1..1..1..1..0....1..1..1..1..0....1..1..1..1..0....0..1..1..1..1
A263121
Number of (n+3)X(3+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
168, 1664, 10356, 56288, 238104, 1294448, 6844676, 35274768, 166684808, 837700064, 4262833076, 21682367296, 106913755512, 530662478800, 2665248077636, 13441453266928, 67154044231144, 333650046421056
Offset: 1
Some solutions for n=4
..1..0..1..1..0..1....0..0..1..1..1..1....1..1..1..1..0..0....1..1..1..1..0..0
..1..0..1..1..0..1....0..0..0..0..0..0....0..0..0..0..0..0....0..0..1..1..1..1
..1..1..1..1..0..0....0..0..1..1..1..1....0..0..1..1..1..1....1..0..1..1..0..1
..0..0..1..1..1..1....0..1..1..1..1..0....1..1..1..1..0..0....0..0..1..1..1..1
..1..0..1..1..0..1....0..0..1..1..1..1....1..1..1..1..0..0....1..1..1..1..0..0
..0..0..0..0..0..0....1..0..1..1..0..1....0..1..1..1..1..0....0..1..1..1..1..0
..0..1..1..1..1..0....1..0..1..1..0..1....1..1..1..1..0..0....0..0..1..1..1..1
A263122
Number of (n+3)X(4+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
912, 28048, 316392, 3049840, 16751376, 216762400, 2168966344, 20154887792, 138240703248, 1449388911184, 14047136614696, 130631050676464, 1009951152099984, 9665650741329760, 91463371579618312, 848124382235101936
Offset: 1
Some solutions for n=2
..1..1..0..1..0..0..1....0..0..1..1..1..1..0....0..0..0..0..0..0..0
..1..1..1..1..0..0..0....1..1..1..1..0..0..0....0..1..1..1..1..0..0
..0..0..0..1..1..1..1....0..0..1..1..1..1..0....1..1..1..1..0..0..0
..1..1..0..1..0..0..1....0..1..0..1..1..0..1....1..0..0..1..0..1..1
..1..0..0..1..0..1..1....0..1..1..1..1..0..0....0..0..0..0..0..0..0
A263125
Number of (1+3)X(n+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
14, 36, 168, 912, 52446, 502800, 5950176, 79674864, 1150876510, 15833668596, 219803283432, 3071596572336, 43104942680030, 602744107942848, 8433329018112000, 118048179597057360, 1652891095755395934
Offset: 1
Some solutions for n=4
..1..0..0..1..0..1..1....0..0..0..1..1..1..1....1..1..1..1..0..0..0
..0..0..1..1..1..1..0....0..0..0..0..0..0..0....0..0..0..0..0..0..0
..0..0..0..0..0..0..0....1..0..0..1..0..1..1....1..1..0..1..0..0..1
..0..1..1..1..1..0..0....0..1..1..1..1..0..0....0..0..1..1..1..1..0
A263123
Number of (n+3)X(5+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
52446, 887805, 17782827, 344322375, 6946980030, 113558538589, 2022945129963, 36861501672007, 713132356848318, 12055652684915197
Offset: 1
Some solutions for n=1
..1..1..1..1..0..0..0..0....1..0..0..0..0..1..1..1....1..1..1..0..0..0..0..1
..0..1..1..1..1..0..0..0....1..0..1..1..0..1..0..0....0..1..1..1..1..0..0..0
..0..1..0..1..1..0..1..0....0..0..0..1..1..1..1..0....1..1..0..1..0..0..1..0
..1..0..0..0..0..1..1..1....0..1..0..1..1..0..1..0....1..0..0..0..0..1..1..1
A263126
Number of (2+3)X(n+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
29, 148, 1664, 28048, 887805, 21881010, 583371100, 16245282600, 474350516221, 13614396562020, 392816467987240, 11368863651747952, 329881756982246141, 9560756720430691666
Offset: 1
Some solutions for n=4
..0..1..0..1..1..0..1....0..0..1..1..1..1..0....0..1..1..1..1..0..0
..1..1..0..1..0..0..1....1..1..0..1..0..0..1....1..0..0..1..0..1..1
..1..0..1..1..0..1..0....1..1..0..1..0..0..1....0..0..0..1..1..1..1
..0..0..0..1..1..1..1....1..1..1..1..0..0..0....1..1..1..1..0..0..0
..1..1..1..1..0..0..0....0..0..0..1..1..1..1....1..1..1..1..0..0..0
A263127
Number of (3+3)X(n+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
59, 522, 10356, 316392, 17782827, 881938092, 47672389112, 2695098564336, 159284816028475, 9294738455527194
Offset: 1
Some solutions for n=3
..1..1..1..1..0..0....0..1..1..1..1..0....1..0..1..1..0..1....1..1..1..1..0..0
..0..0..0..0..0..0....0..0..1..1..1..1....0..1..1..1..1..0....1..1..1..1..0..0
..0..0..0..0..0..0....0..0..1..1..1..1....0..1..1..1..1..0....1..0..1..1..0..1
..0..0..1..1..1..1....1..0..1..1..0..1....1..0..1..1..0..1....0..0..1..1..1..1
..1..0..1..1..0..1....1..0..1..1..0..1....1..0..1..1..0..1....1..1..1..1..0..0
..0..1..1..1..1..0....1..0..1..1..0..1....0..1..1..1..1..0....1..0..1..1..0..1
A263128
Number of (4+3) X (n+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
Original entry on oeis.org
119, 1708, 56288, 3049840, 344322375, 33563774112, 3600054345088, 406348635796752
Offset: 1
Some solutions for n=3
..0..1..1..1..1..0....1..1..1..1..0..0....1..1..1..1..0..0....1..0..1..1..0..1
..0..0..0..0..0..0....1..1..1..1..0..0....1..0..1..1..0..1....0..0..1..1..1..1
..1..0..1..1..0..1....0..0..1..1..1..1....0..0..0..0..0..0....0..0..0..0..0..0
..0..0..1..1..1..1....0..0..0..0..0..0....1..0..1..1..0..1....1..0..1..1..0..1
..0..1..1..1..1..0....1..0..1..1..0..1....1..1..1..1..0..0....1..0..1..1..0..1
..0..0..0..0..0..0....1..1..1..1..0..0....1..0..1..1..0..1....0..0..0..0..0..0
..0..0..1..1..1..1....1..0..1..1..0..1....0..1..1..1..1..0....1..1..1..1..0..0
Showing 1-9 of 9 results.
Comments