A272589 - OEIS

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.

1, 2, 4, 6, 7, 12, 24

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Corresponding distinct F(n) values for listed terms are 1, 3, 8, 13, 144, 46368.

Corresponding F(i) + F(j) values are for listed terms are 1, 2, 7, 9, 94, 28678.

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.

LINKS

Table of n, a(n) for n=1..7.

EXAMPLE

7 is a term because Fibonacci(7) = 13 = sigma(1 + 8) and 1, 8 are Fibonacci numbers.

CROSSREFS

Cf. A000203, A000045, A084176, A272412.

Sequence in context: A138398 A086781 A261220 * A191191 A191190 A191133

Adjacent sequences: A272586 A272587 A272588 * A272590 A272591 A272592

KEYWORD

nonn,more

AUTHOR

Altug Alkan, May 03 2016

STATUS

approved