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!)
A233690 Number of (n+1)X(7+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal 1
43540, 1596200, 62569964, 2662026560, 113995582540, 4934227972036, 213645503481064, 9270801819620976, 402191437421176864, 17459908484631363660, 757809757739957565140, 32899894121039441950420 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 7 of A233691

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

EXAMPLE

Some solutions for n=1

..2..1..2..3..1..0..1..0....2..0..1..0..2..3..1..2....1..2..0..1..0..2..3..1

..0..2..0..2..0..2..3..1....3..1..3..1..0..1..2..0....2..0..1..3..1..3..1..2

CROSSREFS

Sequence in context: A103875 A224623 A210331 * A205923 A251995 A094493

Adjacent sequences:  A233687 A233688 A233689 * A233691 A233692 A233693

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 14 2013

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 November 30 22:31 EST 2021. Contains 349426 sequences. (Running on oeis4.)