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!)
 A236430 Number of representations of 1 as a sum of numbers d*k with d in {-1,1} and k in {1,2,...,n}, where the sum of the numbers k is 2n + 1. 1
 2, 5, 11, 22, 42, 76, 134, 228, 379, 606, 985, 1528, 2364, 3576, 5419, 7988, 11868, 17163, 24937, 35599, 50787, 71290, 100748, 139734, 194113 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) = number of partitions of 2n+1 that contain a partition of n+1. LINKS EXAMPLE a(2) counts these 5 representations of 1: 3-2, 3-1-1, 2+1-2, 2+1-1-1, 1+1+1-1-1. MATHEMATICA p[n_] := p[n] = IntegerPartitions[n]; Map[({p1 = p[#], p2 = p[2 #]} &[#];    Length[Cases[p2, Apply[Alternatives, Map[Flatten[{___, #, ___}] &, p1]]]]) &,  Range[12]] Map[({p1 = p[# + 1], p2 = p[2 # + 1]} &[#]; Length[Cases[p2, Apply[Alternatives, Map[Flatten[{___, #, ___}] &, p1]]]]) &, Range[12]] (* Peter J. C. Moses, Jan 04 2014 *) CROSSREFS Cf. A236429, A235130. Sequence in context: A135119 A290778 A291590 * A058696 A134508 A091357 Adjacent sequences:  A236427 A236428 A236429 * A236431 A236432 A236433 KEYWORD nonn,more AUTHOR Clark Kimberling, Jan 25 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 February 22 22:35 EST 2020. Contains 332155 sequences. (Running on oeis4.)