login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262465 Number of (n+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits. 0
1, 3, 36, 457, 30229, 8080915, 15659602612 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Diagonal of A262472.

LINKS

Table of n, a(n) for n=1..7.

EXAMPLE

Some solutions for n=4

..1..0..0..1..0....0..1..0..0..1....0..1..1..1..1....1..1..0..0..0

..1..0..0..1..0....0..1..0..0..1....1..1..0..1..1....0..0..1..1..0

..1..0..0..1..0....1..1..0..1..1....0..0..1..1..0....1..1..1..1..0

..1..0..0..1..0....0..1..0..0..1....1..0..0..1..0....0..0..1..1..0

..0..0..0..0..0....1..0..0..1..0....0..1..0..0..1....0..0..1..1..0

CROSSREFS

Cf. A262472.

Sequence in context: A099670 A259131 A199258 * A322491 A305678 A233196

Adjacent sequences:  A262462 A262463 A262464 * A262466 A262467 A262468

KEYWORD

nonn

AUTHOR

R. H. Hardin, Sep 23 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 20:01 EST 2021. Contains 349430 sequences. (Running on oeis4.)