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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195749 Smallest possible largest number in a 6 by n average array where repetitions are allowed without diagonals. 0

%I

%S 19,63,2816,1245,143,70668,74283746,622677,34716123,4522574,82212839,

%T 1010388604,34860663827,2227981245

%N Smallest possible largest number in a 6 by n average array where repetitions are allowed without diagonals.

%C Here, an average array is an array with positive integers such that each number in the array is the average of its horizontally and vertically 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 2,1

%A _Kausthub Gudipati_, Sep 23 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 November 24 20:34 EST 2020. Contains 338616 sequences. (Running on oeis4.)