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!)
 A027186 Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the least being k. 2
 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 4, 1, 1, 0, 0, 0, 5, 1, 1, 0, 0, 0, 0, 8, 2, 1, 1, 0, 0, 0, 0, 10, 2, 1, 1, 0, 0, 0, 0, 0, 16, 3, 1, 1, 1, 0, 0, 0, 0, 0, 20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0, 29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 37, 7, 2, 1, 1, 1, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS FORMULA E(n, k) = O(n-k, k)+O(n-k, k+1)+...+O(n-k, n-k), for 2<=2k<=n, O given by A027185. EXAMPLE 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 4, 1, 1, 0, 0, 0, 5, 1, 1, 0, 0, 0, 0, 8, 2, 1, 1, 0, 0, 0, 0, 10, 2, 1, 1, 0, 0, 0, 0, 0, 16, 3, 1, 1, 1, 0, 0, 0, 0, 0, 20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0, 29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 37, 7, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, CROSSREFS Cf. A027185. Sequence in context: A124300 A154326 A330460 * A131962 A302236 A262929 Adjacent sequences:  A027183 A027184 A027185 * A027187 A027188 A027189 KEYWORD nonn,tabl AUTHOR 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 September 26 05:00 EDT 2020. Contains 337346 sequences. (Running on oeis4.)