login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266075 Number of n X n integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one. 0
1, 1, 4, 5, 29, 78, 466, 3907, 52773, 925875, 25789942 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Diagonal of A266081.
LINKS
EXAMPLE
All solutions for n=4
..0..2..3..2....0..0..0..0....0..0..0..0....2..3..2..0....0..0..0..0
..0..3..4..3....2..3..2..0....0..0..0..0....3..4..3..0....0..2..3..2
..0..2..3..2....3..4..3..0....0..0..0..0....2..3..2..0....0..3..4..3
..0..0..0..0....2..3..2..0....0..0..0..0....0..0..0..0....0..2..3..2
CROSSREFS
Cf. A266081.
Sequence in context: A092659 A002352 A042647 * A041273 A256623 A047169
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 20 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)