|
%I #19 Apr 03 2023 10:36:13
%S 2,2,3,4,7,8,11,15,19,29,32,57,90,94,249,299,300,311,353,394,396,2062,
%T 3278,3739,6463,6718,10018,17745,21352,24991,26041,35290,56815,72833,
%U 90265,102810,139616,275876,301148,409631,412163,419815,646697,728882,892522,1135784,1251758,1366768
%N Lengths of binary representations of prime Fibonacci numbers.
%C Some of the larger entries may only correspond to probable primes.
%C As of August 2012, the index of last provable Fibonacci prime is A001605(33)=81839, that is, a(n) corresponds to a probable prime for n>33.
%H C. K. Caldwell, The Prime Glossary, <a href="https://t5k.org/glossary/page.php?sort=FibonacciPrime">Fibonacci prime</a>
%H Henri & Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/prptop.php">Probable primes</a>
%F a(n) = A070939(A005478(n)) = A070939(A000045(A001605(n))).
%e Tenth prime Fibonacci number is A005478(10) = 433494437, 29 digits in the binary representation, so a(10)=29.
%t Length /@ IntegerDigits[Select[Fibonacci[Range[1000]], PrimeQ[#] &], 2] (* _T. D. Noe_, Aug 08 2012 *)
%t IntegerLength[#,2]&/@Select[Fibonacci[Range[1000]],PrimeQ] (* _Harvey P. Dale_, Nov 20 2021 *)
%o (Java)
%o import java.math.BigInteger;
%o public class A215367 {
%o public static void main (String[] args) {
%o BigInteger prpr = BigInteger.valueOf(0);
%o BigInteger prev = BigInteger.valueOf(1), curr;
%o int indices[] = {
%o // === insert terms of A001605 here, followed by a comma === //
%o -1 };
%o int ipos = 1, ind = indices[0];
%o for (long k=1; ; ++k) {
%o if (k==ind) {
%o System.out.printf("%d, ",prev.bitLength());
%o ind = indices[ipos++];
%o if (ind<0) break;
%o }
%o curr = prpr.add(prev);
%o prpr = prev;
%o prev = curr;
%o }
%o }
%o }
%Y Cf. A005478, A020909.
%K nonn,base
%O 1,1
%A _Alex Ratushnyak_, Aug 08 2012
|
