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

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!)
 A098380 Minimum entry in the n-th row of the triangle A097883. 1
 1, 2, 4, 6, 10, 14, 18, 24, 32, 36, 42, 60, 66, 80, 96, 110, 126, 144, 160, 168, 196, 210, 238, 258, 284, 308, 334, 360, 388, 414, 442, 476, 502, 540, 568, 610, 638, 682, 710, 756, 786, 828, 870, 918, 952, 1010, 1038, 1102, 1140, 1198, 1236, 1290, 1332, 1398 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS All entries are even except for 1. LINKS MATHEMATICA a[0, 0] = 1; a[m_, n_] := a[m, n] = Block[{p = Sort[ Flatten[ Join[ Table[ a[i, j], {i, 0, m - 1}, {j, 0, i}], Table[ a[i, j], {i, m, m}, {j, 0, n - 1}]] ]]}, k = Complement[ Range[ p[[ -1]] + 1], p][[1]]; While[ Position[p, k] != {} || If[n == 0, GCD[k, a[m - 1, 0]] != 1, If[n == m, GCD[k, a[m - 1, m - 1]] != 1, GCD[k, a[m - 1, n]] != 1 || GCD[k, a[m - 1, n - 1]] != 1]], k++ ]; k]; Table[ Min[ Table[ a[m, n], {n, 0, m}]], {m, 0, 50}] CROSSREFS Cf. A097883, A098379. Sequence in context: A024518 A128422 A309882 * A007782 A035501 A024204 Adjacent sequences:  A098377 A098378 A098379 * A098381 A098382 A098383 KEYWORD nonn AUTHOR Leroy Quet and Robert G. Wilson v, Sep 04 2004 STATUS approved

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.

Last modified December 6 04:20 EST 2021. Contains 349562 sequences. (Running on oeis4.)