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 A163169 #8 Apr 17 2023 12:22:44
%S A163169 0,2,0,2,0,2,3,2,0,2,4,2,3,2,4,2,0,2,3,2,5,2,4,2,3,2,4,2,7,2,3,2,0,2,
%T A163169 4,2,3,2,4,2,5,2,3,2,8,2,4,2,3,2,4,2,8,2,3,2,7,2,4,2,3,2,4,2,0,2,3,2,
%U A163169 8,2,4,2,3,2,4,2,8,2,3,2,5,2,4,2,3,2,4,2,11,2,3,2,8,2,4,2,3,2,4,2,5,2,3,2
%N A163169 a(n) = minimal number of consecutive integers required which when summed make n.
%C A163169 Zeros occur where no number of consecutive integers can be summed to make n; This only happens where n is an even power of two, or zero itself.
%C A163169 Entries where this sequence is nonzero are in A138591.
%H A163169 Ray Chandler, <a href="/A163169/b163169.txt">Table of n, a(n) for n = 0..10000</a>
%e A163169 20 = 2 + 3 + 4 + 5 + 6; No shorter sequence of consecutive integers sums to 20 and so a(20) = the number of elements in {2,3,4,5,6} = 5.
%e A163169 15 = 4 + 5 + 6, but also 15 = 7 + 8, so a(15) = 2, since this is the minimum.
%Y A163169 Cf. A138591, A057716.
%K A163169 easy,nonn
%O A163169 0,2
%A A163169 _Carl R. White_, Jul 22 2009