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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317873 Number of digits in 2^(n!). 2

%I #32 Apr 18 2024 09:30:09

%S 1,1,2,8,37,217,1518,12138,109238,1092378,12016155,144193850,

%T 1874520045,26243280622,393649209329,6298387349264,107072584937472,

%U 1927306528874488,36618824048615255,732376480972305082,15379906100418406713,338357934209204947674

%N Number of digits in 2^(n!).

%C The old definition (which did not match the data) was "Number of digits in the numerators of partial sums for Liouville's constant, read as base-2 (binary) numbers (A145572)."

%H Kevin Ryde, <a href="/A317873/b317873.txt">Table of n, a(n) for n = 1..300</a>

%F a(n) = A034887(n!).

%p Digits := 900: # for n <= 300

%p a := n -> ceil(exp(lnGAMMA(n + 1))*log10(2)):

%p seq(a(n), n = 1..300); # _Peter Luschny_, Apr 18 2024

%t Array[ Floor[#! Log10@2 + 1] &, 22]

%Y Cf. A034887, A050923, A055642, A145572.

%K nonn,base,changed

%O 1,3

%A _Wolfdieter Lang_ and _Robert G. Wilson v_, Aug 09 2018

%E Better definition suggested by _Martin Renner_, Mar 24 2024

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 19 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)