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 A373895 #16 Jun 21 2024 14:19:24 %S A373895 2,3,4,5,8,12,20,33,58,104,188,343,632,1172,2186,4097,7712,14565, %T A373895 27596,52430,99866,190652,364724,699052,1342179,2581112,4971028, %U A373895 9586982,18512792,35791396,69273668,134217729,260301050,505290272,981706812,1908874355,3714566312,7233629132,14096302922,27487790696 %N A373895 a(n) = ceiling((2^n+n-1)/n). %C A373895 a(n) is the irregularity strength of the hypercube graph Q_n for n >= 2. %H A373895 Michael De Vlieger, <a href="/A373895/b373895.txt">Table of n, a(n) for n = 1..3333</a> %H A373895 G. Ebert, J. Hammenter, F. Lazebnik, and A. Woldar, <a href="https://www.researchgate.net/publication/246544317_Irregularity_Strengths_For_Certain_Graphs">Irregularity Strengths for Certain Graphs</a>, Congressus Numerantium 71 (1990), 39-52. %H A373895 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HypercubeGraph.html">Hypercube Graph</a>. %H A373895 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IrregularityStrength.html">Irregularity Strength</a>. %t A373895 Array[Ceiling[(2^# + # - 1)/#] &, 120] (* _Michael De Vlieger_, Jun 21 2024 *) %Y A373895 Cf. A052944, A053638, A082482. %K A373895 nonn,easy %O A373895 1,1 %A A373895 _Eric W. Weisstein_, Jun 21 2024