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!)
A195753 Smallest possible largest number in a 3 by n average array where repetitions are not allowed without diagonals. 0

%I

%S 8,30,74,269,356,3309,11178,10351,28028,519141,56511,6511653,4798118,

%T 3319643

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

%C Here, an average array is an array of positive numbers such that each number is the average of the numbers in 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 06:47 EDT 2023. Contains 361529 sequences. (Running on oeis4.)