cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A374923 a(n) is the least k such that 2^k begins with n!.

This page as a plain text file.
%I A374923 #41 Oct 30 2024 21:07:34
%S A374923 0,0,1,6,81,80,56,7284,33889,2044921,8151937,127668791,258943304,
%T A374923 19207561921,189815680859,2687562198191,75909586168557,
%U A374923 512148453482307,5376323935222903,502774568129731130,1053338431686717460,122114339415457901831,2120280158164651048122
%N A374923 a(n) is the least k such that 2^k begins with n!.
%H A374923 Zhao Hui Du, <a href="/A374923/b374923.txt">Table of n, a(n) for n = 0..100</a>
%F A374923 a(n) = A018856(n!).
%e A374923 a(4) = 81 because 2^81 = 2417851639229258349412352 is the smallest power of 2 beginning with 4! = 24.
%t A374923 a[n_] := Module[{target = IntegerDigits[n!], k = 0},
%t A374923    While[UnsameQ[Take[IntegerDigits[2^k], Length@target], target],
%t A374923     k++]; k];
%t A374923 Table[a[n], {n, 0, 8}]
%Y A374923 Cf. A018856, A000142, A152561, A374922.
%K A374923 nonn,base
%O A374923 0,4
%A A374923 _Zhining Yang_, Jul 23 2024
%E A374923 a(13) onwards from _Zhao Hui Du_, Oct 02 2024