This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A083412 #19 Feb 16 2025 08:32:49
%S A083412 1,4,2,6,7,3,9,10,11,5,12,15,16,18,8,14,20,24,26,29,13,17,23,32,39,42,
%T A083412 47,21,19,28,37,52,63,68,76,34,22,31,45,60,84,102,110,123,55,25,36,50,
%U A083412 73,97,136,165,178,199,89,27,41,58,81,118,157,220,267,288,322,144,30,44
%N A083412 Wythoff array read by rising antidiagonals.
%C A083412 The first term in each row is the least summand in the Zeckendorf representation of every term in the row. - _Clark Kimberling_, Aug 27 2008
%H A083412 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WythoffArray.html">Wythoff Array</a>
%H A083412 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%p A083412 W:= proc(n,k) Digits:= 100; (Matrix([n, floor((1+sqrt(5))/2* (n+1))]). Matrix([[0,1], [1,1]])^(k+1))[1,2] end: seq(seq(W(d-k, k), k=0..d), d=0..10); # _Alois P. Heinz_, Aug 18 2008
%t A083412 W[n_, k_] := Fibonacci[k + 1] Floor[n*GoldenRatio] + (n - 1) Fibonacci[k]; t = Table[ W[n - k + 1, k], {n, 12}, {k, n}] // Flatten
%Y A083412 A035513 transposed. See that entry for further details.
%K A083412 nonn,tabl
%O A083412 0,2
%A A083412 _N. J. A. Sloane_, Jun 09 2003
%E A083412 More terms from _Alois P. Heinz_, Aug 18 2008