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!)
A195811 Smallest possible largest number of a 5 by n average array where repetitions are not allowed with diagonals. 0

%I

%S 3087,353073,2132027,268488939,1753185101,1972426351,3443919804825,

%T 6614878861143,36878438722065,500316181326089640,8297069251057289337,

%U 6347210584170775952,2484311052067594484723

%N Smallest possible largest number of a 5 by n average array where repetitions are not allowed with diagonals.

%C Here, an average array is an array of positive integers such that each number is the average of the numbers in its horizontally, vertically and diagonally adjacent cells.

%H Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0399.html">Problem of the month March 1999</a>

%K nonn

%O 3,1

%A _Kausthub Gudipati_, Sep 24 2011

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 5 00:21 EST 2021. Contains 349530 sequences. (Running on oeis4.)