login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A146545

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of n X n arrays of squares of integers summing to 30 with every element equal to at least one neighbor.
(history; published version)
#4 by Charles R Greathouse IV at Fri Dec 18 18:17:15 EST 2015
NAME

Number of nXn n X n arrays of squares of integers summing to 30 with every element equal to at least one neighbor.

Discussion
Fri Dec 18
18:17
OEIS Server: https://oeis.org/edit/global/2478
#3 by Russ Cox at Sat Mar 31 12:35:11 EDT 2012
AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Apr 14 2009

Discussion
Sat Mar 31
12:35
OEIS Server: https://oeis.org/edit/global/875
#2 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010
KEYWORD

nonn,new

nonn

AUTHOR

Ron R. H. Hardin (rhhardin(AT)att.net) Apr 14 2009

#1 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
NAME

Number of nXn arrays of squares of integers summing to 30 with every element equal to at least one neighbor.

DATA

0, 132, 48330, 29269010, 23421826314

OFFSET

2,2

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net) Apr 14 2009

STATUS

approved