[seqfan] Possible typo in A020909 Number of bits in base 2 representation of n-th Fibonacci number

[Georgi Guninski]

A020909 Number of bits in base 2 representation of n-th Fibonacci number
FORMULA a(n) = trunc( 1 + log_2( A000040(n) )). 
A000040 The prime numbers. 

I am unsure the formula is correct, it appears to give A035100 Number of bits in binary expansion of n-th prime.