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 A272589 #18 May 05 2016 21:23:56 %S A272589 1,2,4,6,7,12,24 %N A272589 Numbers n such that the equation F(n) = sigma(F(i) + F(j)) has a solution with i >= 1 and j >= 0, where F(k) = A000045(k) represents the k-th Fibonacci number. %C A272589 Corresponding distinct F(n) values for listed terms are 1, 3, 8, 13, 144, 46368. %C A272589 Corresponding F(i) + F(j) values are for listed terms are 1, 2, 7, 9, 94, 28678. %C A272589 It is known that for almost all positive integers n, the sum of divisors of Fibonacci(n) is not a Fibonacci number (see A272412). This sequence focuses on the sums of two Fibonacci numbers for a similar question. Since A000045 is obvious subsequence of A084176 by definition of Fibonacci numbers, the reason of existence of this sequence can be seen as a generalized version of question that is motivation of A272412. %e A272589 7 is a term because Fibonacci(7) = 13 = sigma(1 + 8) and 1, 8 are Fibonacci numbers. %Y A272589 Cf. A000203, A000045, A084176, A272412. %K A272589 nonn,more %O A272589 1,2 %A A272589 _Altug Alkan_, May 03 2016