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 A094607 #2 Mar 30 2012 18:57:05
%S A094607 1,2,3,4,5,8,7,6,11,16,12,9,13,21,24,20,10,14,26,29,37,33,15,18,27,39,
%T A094607 42,58,54,17,19,32,40,45,66,63,88,25,22,34,47,50,76,71,97,143,28,23,
%U A094607 35,48,60,84,79,100,105,232,41,30,43,55,61,94,92,131,113,152,376,46,31,44
%N A094607 Rectangular array T by antidiagonals: row n consists of the positive integers k for which there are exactly n sets of Fibonacci numbers whose sum is k.
%C A094607 Row n gives the ranks of n in A000119 after the initial 1 is deleted. Every positive integer occurs exactly once in T; thus a is a permutation of the positive integers. Row 1 is A000071 except for initial terms. Column 1 is A013583.
%e A094607 A northwest corner of T:
%e A094607 1 2 4 7 12
%e A094607 3 5 6 9 10
%e A094607 8 11 13 14 18
%e A094607 16 21 26 27 32
%e A094607 6 is in row 2 because there are exactly 2 sets of Fibonacci
%e A094607 numbers whose sum is 6. They are {1,5} and {1,2,3}.
%Y A094607 Cf. A000045, A000119, A094608.
%K A094607 nonn,tabl
%O A094607 1,2
%A A094607 _Clark Kimberling_, May 14 2004