Number of bits necessary to represent u(n) in binary, where u is the Lucas-Lehmer sequence: u(0) = 100 (in binary); for n>0, u(n) = u(n-1)^2 - 2.
A227615
Number of bits necessary to represent u(n) in binary, where u is the Lucas-Lehmer sequence: u(0) = 100 (in binary); for n>0, u(n) = u(n-1)^2 - 2.
Terms
- a(0) =3a(1) =4a(2) =8a(3) =16a(4) =31a(5) =61a(6) =122a(7) =244a(8) =487a(9) =973a(10) =1946a(11) =3892a(12) =7783a(13) =15565a(14) =31130a(15) =62259a(16) =124517a(17) =249033a(18) =498066a(19) =996131a(20) =1992262a(21) =3984524a(22) =7969047a(23) =15938093a(24) =31876185a(25) =63752369a(26) =127504737a(27) =255009473a(28) =510018945a(29) =1020037890
External references
- oeis: A227615