login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
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
EXAMPLE
7 is a term because Fibonacci(7) = 13 = sigma(1 + 8) and 1, 8 are Fibonacci numbers.
CROSSREFS
Sequence in context: A138398 A086781 A261220 * A191191 A191190 A191133
KEYWORD
nonn,more
AUTHOR
Altug Alkan, May 03 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 26 21:09 EDT 2024. Contains 375462 sequences. (Running on oeis4.)