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

 


Highly composite Fibonacci numbers.
3

%I #11 Oct 14 2019 03:33:39

%S 1,2,8,144,2584,46368,14930352,4807526976,1548008755920,

%T 498454011879264,160500643816367088,2880067194370816120,

%U 51680708854858323072,16641027750620563662096,5358359254990966640871840

%N Highly composite Fibonacci numbers.

%C Positive Fibonacci numbers with record values for the number of divisors.

%H Amiram Eldar, <a href="/A154908/b154908.txt">Table of n, a(n) for n = 1..33</a>

%e 144 is in the sequence because it is a Fibonacci number with 15 divisors and all smaller Fibonacci numbers have fewer divisors. - _Emeric Deutsch_, Jan 20 2009

%p with(numtheory): with(combinat): a := proc (n) if n = 1 then 1 else if max(seq(tau(fibonacci(j)), j = 1 .. n-1)) < tau(fibonacci(n)) then fibonacci(n) else end if end if end proc: seq(a(n), n = 1 .. 170); # _Emeric Deutsch_, Jan 20 2009

%Y Cf. A000005, A000045, A002182, A063375, A154906, A154907.

%K nonn

%O 1,2

%A _Omar E. Pol_, Jan 18 2009, Jan 20 2009

%E Extended by _Emeric Deutsch_, Jan 20 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 20 23:55 EDT 2024. Contains 376078 sequences. (Running on oeis4.)