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 A306248 #40 May 25 2023 01:27:40
%S A306248 1,2,1,3,1,3,1,4,1,3,1,4,1,3,1,5,1,3,1,5,1,3,1,6,1,3,1,5,1,3,1,6,1,3,
%T A306248 1,6,1,3,1,6,1,3,1,6,1,3,1,7,1,3,1,6,1,3,1,7,1,3,1,6,1,3,1,7,1,3,1,6,
%U A306248 1,3,1,8,1,3,1,6,1,3,1,7,1,3,1,6,1,3,1,7,1,3,1,6,1,3,1
%N A306248 Smallest m for which 2n is not m-powerful (for the definition of k-powerful see A323395).
%C A306248 This function is known as m*(2n). For odd n all values of m*(n) are 0.
%H A306248 S. Golan, <a href="https://doi.org/10.1090/S0025-5718-08-02072-3">Equal moments division of a set</a>, Math. Comp. 77 (2008) 1695-1712.
%H A306248 Stan Wagon, <a href="/A306248/a306248_1.txt">Data for n up to 128</a>, updated Sep 29 2019.
%e A306248 The bipartition {1,4}, {2,3} of {1,2,3,4} has equal first power-sums. But there is no such bipartition with equal power-sums for exponents 0, 1, and 2. Therefore a(2) = 2.
%Y A306248 Cf. A323395, A323610, A323629, A323614.
%K A306248 nonn,hard
%O A306248 1,2
%A A306248 _Stan Wagon_, Jan 31 2019
%E A306248 a(56) corrected by _Stan Wagon_, May 06 2019
%E A306248 a(72) corrected by _Stan Wagon_, May 24 2019