The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A247211 a(0) = 0. a(n) is the number of repeating sums made from [a(0), ... a(n-1)] + [a(0), ... a(n-1)] + ... + [a(0), ... a(n-1)], where [a(0), ... a(n-1)] is repeated n times. 0
 0, 0, 2, 6, 23, 80, 302, 1160, 4504, 17087, 66327 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(i)+a(j) and a(j)+a(i) are considered to be the same sum for all indices i and j. LINKS EXAMPLE a(1) is the number of repeating sums made from . No sums can be made from this because 0 is not being added to anything. So a(1) = 0. a(2) is the number of repeating sums made from [0,0] + [0,0]. The possible sums are 0+0, 0+0, and 0+0, so a(2) = 2. a(3) is the number of repeating sums made from [0,0,2] + [0,0,2] + [0,0,2]. The possible sums are 0+0+0, 0+0+0, 0+0+2, 0+0+0, 0+0+2, 0+2+2, 0+0+0, 0+0+2, 0+2+2, and 2+2+2. There are 6 repeating sums so a(3) = 6. a(4) is the number of repeating sums made from [0,0,2,6] + [0,0,2,6] + [0,0,2,6] + [0,0,2,6]. There are 23 repeating sums, so a(4) = 23. CROSSREFS Sequence in context: A220213 A217200 A110068 * A150275 A335537 A150276 Adjacent sequences:  A247208 A247209 A247210 * A247212 A247213 A247214 KEYWORD nonn,more,hard AUTHOR Derek Orr, Nov 26 2014 STATUS approved

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

Last modified October 31 05:06 EDT 2020. Contains 338098 sequences. (Running on oeis4.)