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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A330431 a(n) is the smallest k such that {1^2, 2^2, 3^2, ..., k^2} can be partitioned into n sets of equal sums. 1
 1, 7, 13, 15, 19, 31, 27, 32, 53, 39, 43, 63, 52, 55 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..14. EXAMPLE For n = 1 the set is {1} For n = 2 the sets are {1,2,4,7}, {3,5,6}. For n = 3 the sets are {2,10,13}, {4,7,8,12}, {1,3,5,6,9,11}. For n = 4 the sets are {2,9,15}, {1,7,8,14}, {4,5,10,13}, {3,6,11,12}. For n = 5 the sets are {4,6,9,19}, {1,13,18}, {3,14,17}, {2,7,8,11,16}, {5,10,12,15}. For n = 6 the sets are {1,3,6,27,31}, {4,12,26,30}, {5,7,14,25,29}, {2,8,20,22,28}, {9,13,15,18,19,24}, {10,11,16,17,21,23}. CROSSREFS Cf. A019568, A240070, A330212. Sequence in context: A224773 A349749 A076196 * A349751 A349752 A167782 Adjacent sequences: A330428 A330429 A330430 * A330432 A330433 A330434 KEYWORD nonn,more AUTHOR Dean D. Ballard, Jun 08 2020 EXTENSIONS a(12) from Giovanni Resta, Jun 08 2020 a(13)-a(14) from Dean D. Ballard, Jun 12 2020 STATUS approved

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.

Last modified September 17 04:45 EDT 2024. Contains 375985 sequences. (Running on oeis4.)