|
%I #19 Apr 27 2016 23:45:47
%S 1,2,8,46368,4807526976
%N Refactorable Fibonacci numbers.
%C Luca & Young prove that there are no more terms in this sequence. - _Charles R Greathouse IV_, Apr 27 2016
%H Florian Luca and Paul Thomas Young, <a href="https://pdfs.semanticscholar.org/c341/206d68979e1668fc470f668868ccd3b69bcc.pdf">On the number of divisors of n! and of the Fibonacci numbers</a>
%F a(n) = A000045(A160683(n+1)). - _Michel Marcus_, Apr 25 2016
%e 8 is a term as a Fibonacci number that is divisible by the number of its divisors, (1,2,4,8), which is 4.
%p select(t -> t mod numtheory:-tau(t) = 0, map(combinat:-fibonacci, [$2..200])); # _Robert Israel_, Apr 27 2016
%t DeleteDuplicates@Select[Fibonacci@Range@200, Divisible[#, IntegerLength@#]&]
%o (PARI) for(n=2, 200, fn=fibonacci(n); fn%numdiv(fn)==0&&print1(fn ", "))
%Y Intersection of A000045 (Fibonacci numbers) and A033950 (refactorable numbers).
%Y Cf. A000005 (number of divisors), A160683.
%K nonn,fini,full
%O 1,2
%A _Waldemar Puszkarz_, Apr 25 2016
| 