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 A183090 #11 Feb 11 2025 01:30:36 %S A183090 1,2,3,4,6,5,8,7,11,12,9,10,16,15,14,13,21,23,22,25,17,18,19,20,30,33, %T A183090 29,31,27,28,24,26,42,41,45,46,43,44,50,49,32,34,35,36,37,38,40,39,58, %U A183090 60,64,67,56,59,61,62,53,54,55,57,48,47,51,52 %N A183090 Tree generated by A005652, associated with numbers which are not the sum of two Fibonacci numbers. %C A183090 A permutation of the positive integers. See the comment at A183079. %F A183090 Let L(n)=A005652(n) and U(n)=A005653(n), these being complementary sequences, each comprising a maximal set no two of whose elements is a Fibonacci number. %F A183090 The tree-array T(n,k) is then given by rows: %F A183090 T(0,0)=1; T(1,0)=2; %F A183090 T(n,2*j)=L(T(n-1,j)); %F A183090 T(n,2*j+1)=U(T(n-1,j)); %F A183090 for j=0,1,...,2^(n-1)-1, n>=2. %e A183090 Top 5 rows: %e A183090 1; %e A183090 2; %e A183090 3, 4; %e A183090 6, 5, 8, 7; %e A183090 11, 12, 9, 10, 16, 15, 14, 13; %e A183090 From row 3 to row 4: 3->(6,5) and 4->(8,7). For all such pairs, the 1st component is in L and the 2nd, in U. %Y A183090 Cf. A005652, A005653, A183079, A074049. %K A183090 nonn,tabf %O A183090 1,2 %A A183090 _Clark Kimberling_, Dec 24 2010