login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019568 a(n) = smallest k >= 1 such that {1^n, 2^n, 3^n, ..., k^n} can be partitioned into two sets with equal sum. 7
2, 3, 7, 12, 16, 24, 31, 39, 47, 44, 60, 71, 79 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

a(n) is least integer k such that at least one signed sum of the first k n-th powers equals zero.

a(n) < 2^(n+1). The partition of the set {k: 0=<k<2^(n+1)} into two sets A,B according to the parity of the number of 1s in the binary expansion of k, has the property that sum_{k in A} p(k) = sum_{k in B} p(k) for any polynomial p of degree <= n. Equivalently, if e(k) is the Thue-Morse sequence A106400, then sum_{0=<k<2^m} e(k)p(k) = 0 for any polynomial p with deg(p) < m. - Pietro Majer, Mar 14 2009

REFERENCES

Posting to sci.math Nov 11 1996 by fredh(AT)ix.netcom.com (Fred W. Helenius).

LINKS

Table of n, a(n) for n=0..12.

Pietro Majer, MathOverflow: Asymptotic growth of a certain integer sequence

FORMULA

a(n) == 0 or 3 (mod 4) for n >= 1 - David W. Wilson, Oct 20 2005

EXAMPLE

For n=1 and 2 we have: 1+2-3 = 0 (so a(1)=3), 1+4-9+16-25-36+49 = 0 (so a(2)=7).

The sum of the ninth powers of 3 5 9 10 14 19 20 21 25 26 28 31 35 36 37 38 40 41 42 is half the sum of the ninth powers of 1..44, so a(9)=44. - Don Reble, Oct 21 2005

Example: the signs (+--+-++--++-+--+) in (+0)-1-8+27-64+125+216-...+3375=0 are those of the expansion of Q(x):=(1-x)(1-x^2)(1-x^4)(1-x^8) = +1-x-x^2+x^3-..+x^15. Since (1-x)^4 divides Q(x), if S is the shift operator on sequences, the operator Q(S) has the fourth discrete difference (I-S)^4 as factor, hence annihilates the sequence of cubes. - Pietro Majer, Mar 14 2009

MATHEMATICA

Table[k = 1; found = False; While[s = Range[k]^n; sm = Total[s]; If[EvenQ[sm], sm = sm/2; found = MemberQ[Total /@ Subsets[s], sm]]; ! found, k++]; k, {n, 0, 4}] (* T. D. Noe, Apr 01 2014 *)

CROSSREFS

Cf. A240070 (partitioned into 3 sets).

Sequence in context: A191704 A168249 A080140 * A128458 A066733 A049623

Adjacent sequences:  A019565 A019566 A019567 * A019569 A019570 A019571

KEYWORD

nonn

AUTHOR

Robert G. Wilson v

EXTENSIONS

More from Don Reble, Oct 21 2005

Definition simplified by Pietro Majer, Mar 15 2009

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 26 17:50 EST 2014. Contains 250081 sequences.