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

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Examples

			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
		

Crossrefs

Column 1 of A263124.

Formula

Empirical: a(n) = 2*a(n-1) + a(n-4) - 2*a(n-5) = A265381(n+2).
Empirical g.f.: x*(14 + x + x^2 + x^3 - 14*x^4) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 + x^2)). - Colin Barker, Jan 01 2019

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Column 2 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

Formula

Empirical: a(n) = 4*a(n-1) -a(n-2) -8*a(n-3) +48*a(n-4) -168*a(n-5) +48*a(n-6) +312*a(n-7) -955*a(n-8) +2884*a(n-9) -955*a(n-10) -4832*a(n-11) +7632*a(n-12) -16032*a(n-13) +7632*a(n-14) +17568*a(n-15) +4886*a(n-16) -72248*a(n-17) +4886*a(n-18) +197200*a(n-19) -366336*a(n-20) +873744*a(n-21) -366336*a(n-22) -1155888*a(n-23) +1014058*a(n-24) -588568*a(n-25) +1014058*a(n-26) -2290528*a(n-27) +6020160*a(n-28) -17209056*a(n-29) +6020160*a(n-30) +27546528*a(n-31) -27604133*a(n-32) +27776948*a(n-33) -27604133*a(n-34) +27085688*a(n-35) -75797424*a(n-36) +221932632*a(n-37) -75797424*a(n-38) -362608200*a(n-39) +362785825*a(n-40) -363318700*a(n-41) +362785825*a(n-42) -361187200*a(n-43) +406335600*a(n-44) -541780800*a(n-45) +406335600*a(n-46)

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Column 3 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Column 4 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Row 1 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Column 5 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Row 2 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Row 3 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.

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

Views

Author

R. H. Hardin, Oct 10 2015

Keywords

Comments

Row 4 of A263124.

Examples

			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
		

Crossrefs

Cf. A263124.
Showing 1-9 of 9 results.