login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306248 Smallest m for which 2n is not m-powerful (for the definition of k-powerful see A323395). 1

%I #40 May 25 2023 01:27:40

%S 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 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 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 Smallest m for which 2n is not m-powerful (for the definition of k-powerful see A323395).

%C This function is known as m*(2n). For odd n all values of m*(n) are 0.

%H 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 Stan Wagon, <a href="/A306248/a306248_1.txt">Data for n up to 128</a>, updated Sep 29 2019.

%e 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 Cf. A323395, A323610, A323629, A323614.

%K nonn,hard

%O 1,2

%A _Stan Wagon_, Jan 31 2019

%E a(56) corrected by _Stan Wagon_, May 06 2019

%E a(72) corrected by _Stan Wagon_, May 24 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)