OFFSET
1,1
COMMENTS
6 is the smallest integer n which is the product of two distinct primes and which divides the sum of the cubes of the divisors of n. Are there other numbers with this property?
Using Pell equations and a Fibonacci identity, Max Alekseyev and I have shown that all terms are the product of prime Fibonacci numbers whose indices are twin primes. The first three terms are Fib(3)*Fib(5), Fib(5)*Fib(7) and Fib(11)*Fib(13). The other two known terms are Fib(431)*Fib(433) and Fib(569)*Fib(571), huge numbers that are in the b-file. The sequence probably has no additional terms. - T. D. Noe, Jul 27 2008
Let a, b, c and d be consecutive odd-indexed Fibonacci numbers. Then it can be proved that 1 + b^2 + c^2 + (bc)^2 = abcd, which shows that bc divides 1 + b^2 + c^2 + (bc)^2. Hence if b and c are prime, then bc is in this sequence. - T. D. Noe, Jul 27 2008
LINKS
T. D. Noe, Table of n, a(n) for n=1..5
T. Cai, D. Chen, Y. Zhang, Perfect numbers and Fibonacci primes, arXiv:1310.0898 [math.NT], 2013-2014.
T. Cai, D. Chen, Y. Zhang, Perfect numbers and Fibonacci primes (II), arXiv:1406.5684 [math.NT], 2014 (see case m=1 in Table 1).
EXAMPLE
10 divides (1^2 + 2^2 + 5^2).
65 divides (1^2 + 5^2 + 13^2).
20737 divides (1^2 + 89^2 + 233^2).
PROG
(PARI) isok(n) = sigma(n, 2) - n^2 == 3*n; \\ Michel Marcus, Jun 24 2014
CROSSREFS
KEYWORD
nonn,bref
AUTHOR
Mohamed Bouhamida, Jul 22 2008, Jul 27 2008
STATUS
approved