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

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!)
 A239402 Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it, modulo 4 1
 32, 2165, 144762, 9340070, 614216271, 40566958960, 2671846338458, 176044655676921, 11610439554314901, 765805659265654829, 50509810922229600429, 3331665731491459450247, 219768507035072764751942 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 5 of A239405 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 EXAMPLE Some solutions for n=2 ..0..3..3..0..0....3..1..0..3..1....3..3..1..3..0....0..0..0..3..1 ..3..2..0..1..1....2..1..3..0..0....3..3..1..3..0....3..1..0..0..0 CROSSREFS Sequence in context: A079202 A294607 A294953 * A085526 A101441 A321663 Adjacent sequences:  A239399 A239400 A239401 * A239403 A239404 A239405 KEYWORD nonn AUTHOR R. H. Hardin, Mar 17 2014 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.

Last modified December 9 02:23 EST 2021. Contains 349624 sequences. (Running on oeis4.)