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.
%I A177498 #27 Jan 23 2025 10:23:23
%S A177498 20,98,54,38,152,94,68,260,154,332,696,386,234,476,1002,548,1138,2342,
%T A177498 656,1342,746,800,1648,3332,1750,3530,1852,1016,2158,2226,8904,1250,
%U A177498 9684,2566,2668,5378,2838,2940,11634,3076,12414,6368,12804,3382,3586,7358,14754
%N A177498 a(n) is the maximal positive integer m for which exponents of prime(n) and prime(n+1) in the prime power factorization of m! are both powers of 2.
%C A177498 For n=2 the corresponding value is not known; moreover, we do not know if this value is finite (in any case, it is not less than 524306). See also comment to A177458.
%C A177498 If a(2) exists, then it is at least 81129638414606681695789005144146. - _Charles R Greathouse IV_, Apr 10 2012
%H A177498 Vladimir Shevelev, <a href="https://eudml.org/doc/277854">Compact integers and factorials</a>, Acta Arithmetica 126 (2007), no. 3, 195-236.
%F A177498 The maximal m with the considered property is in interval [q, 2*(-1+q^2*(log(2)/(2*log(q)-1)+1))), where q=prime(n+1).
%t A177498 tp[n_] := Flatten[Position[FoldList[Plus, 0, IntegerExponent[Range[100000], n]], _?(IntegerQ[Log[2, #]] &)]]; Table[s = Intersection[tp[Prime[n]], tp[Prime[n + 1]]] - 1; s[[-1]], {n, 3, 60}] (* _T. D. Noe_, Apr 10 2012 *)
%Y A177498 Cf. A000142, A177458, A177459, A177355, A177349, A177378, A177436, A050376, A168655, A169661.
%K A177498 nonn
%O A177498 3,1
%A A177498 _Vladimir Shevelev_, May 10 2010
%E A177498 Extended by _T. D. Noe_, Apr 10 2012