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

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

Original entry on oeis.org

366629, 12652497, 398648507, 11542428929, 333834894509, 9669206035811, 281744631338581, 8168432979144243, 236803228434060000, 6872338129370139753, 199369625571670867675, 5782741479669647970363, 167698271515683910798963
Offset: 1

Views

Author

R. H. Hardin, Oct 11 2015

Keywords

Comments

Column 2 of A263198.

Examples

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

Links

Crossrefs

Cf. A263198.

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

Original entry on oeis.org

22718, 366629, 5486039, 76647286, 1068732662, 14937290926, 209908668003, 2937919473696, 41102571427488, 575909145559159, 8065820852218665, 112941785153648623, 1581143563815783512, 22137080151280996895
Offset: 1

Views

Author

R. H. Hardin, Oct 11 2015

Keywords

Comments

Column 1 of A263198.

Examples

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

Links

Crossrefs

Cf. A263198.

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

Original entry on oeis.org

5486039, 398648507, 26007537155, 1532722380695, 90272986428673, 5321603354246163, 315848755007977111
Offset: 1

Views

Author

R. H. Hardin, Oct 11 2015

Keywords

Comments

Column 3 of A263198.

Examples

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

Crossrefs

Cf. A263198.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.