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 A059503 #21 Sep 15 2017 08:13:22 %S A059503 1,2,3,3,5,9,4,7,14,27,5,9,19,40,80,6,11,24,53,114,234,7,13,29,66,148, %T A059503 323,677,8,15,34,79,182,412,910,1941,9,17,39,92,216,501,1143,2551, %U A059503 5523,10,19,44,105,250,590,1376,3161,7120,15615,11,21,49,118 %N A059503 The array in A059502 read by antidiagonals in 'up' direction. %H A059503 G. C. Greubel, <a href="/A059503/b059503.txt">Table of n, a(n) for the first 50 rows, flattened</a> %H A059503 <a href="/index/Bo#boustrophedon">Index entries for sequences related to boustrophedon transform</a> %F A059503 T(n,k) = ((3 - k)*Fibonacci(2*k) + (5*n + 3*k)*Fibonacci(2*k - 1))/5. - _G. C. Greubel_, Sep 10 2017 %e A059503 The array begins %e A059503 1 3 9 27 80 ... %e A059503 2 5 14 40 ... %e A059503 3 7 19 ... %e A059503 4 9 5 ... %t A059503 T[n_, k_] := ((3 - k)*Fibonacci[2*k] + (5*n + 3*k)*Fibonacci[2*k - 1])/5; %t A059503 TableForm[Table[T[n, k], {n, 0, 5}, {k, 1, 5}]] %t A059503 Table[T[n - k, k + 1], {n, 0, 10}, {k, 0, n}]//Flatten (* _G. C. Greubel_, Sep 10 2017 *) %Y A059503 Rows give A059502, A059505, A059506, A059507, A059508; main diagonal = A059509. %Y A059503 Cf. A000667, A059216, A059219. %K A059503 nonn,tabl,nice,easy %O A059503 0,2 %A A059503 _Floor van Lamoen_, Jan 19 2001