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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035363 Number of partitions of n into even parts. 95
1, 0, 1, 0, 2, 0, 3, 0, 5, 0, 7, 0, 11, 0, 15, 0, 22, 0, 30, 0, 42, 0, 56, 0, 77, 0, 101, 0, 135, 0, 176, 0, 231, 0, 297, 0, 385, 0, 490, 0, 627, 0, 792, 0, 1002, 0, 1255, 0, 1575, 0, 1958, 0, 2436, 0, 3010, 0, 3718, 0, 4565, 0, 5604, 0, 6842, 0, 8349, 0, 10143, 0, 12310, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

COMMENTS

Convolved with A036469 = A000070. - Gary W. Adamson, Jun 09 2009

Note that these partitions are located in the head of the last section of the set of partitions of n (see A135010). - Omar E. Pol, Nov 20 2009

Number of symmetric unimodal compositions of n+2 where the maximal part appears twice, see example. Also number of symmetric unimodal compositions of n where the maximal part appears an even number of times. - Joerg Arndt, Jun 11 2013

Number of partitions of n having parts of even multiplicity. These are the conjugates of the partitions from the definition. Example: a(8)=5 because we have [4,4],[3,3,1,1],[2,2,2,2],[2,2,1,1,1,1], and [1,1,1,1,1,1,1,1]. - Emeric Deutsch, Jan 27 2016

From Gus Wiseman, May 22 2021: (Start)

The Heinz numbers of the conjugate partitions described in Emeric Deutsch's comment above are given by A000290.

For n > 1, also the number of integer partitions of n-1 whose only odd part is the smallest. The Heinz numbers of these partitions are given by A341446. For example, the a(2) = 1 through a(14) = 15 partitions (empty columns shown as dots, A..D = 10..13) are:

  1  .  3   .  5    .  7     .  9      .  B       .  D

        21     41      43       63        65         85

               221     61       81        83         A3

                       421      441       A1         C1

                       2221     621       443        643

                                4221      641        661

                                22221     821        841

                                          4421       A21

                                          6221       4441

                                          42221      6421

                                          222221     8221

                                                     44221

                                                     62221

                                                     422221

                                                     2222221

Also the number of integer partitions of n whose greatest part is the sum of all the other parts. The Heinz numbers of these partitions are given by A344415. For example, the a(2) = 1 through a(12) = 11 partitions (empty columns not shown) are:

  (11)  (22)   (33)    (44)     (55)      (66)

        (211)  (321)   (422)    (532)     (633)

               (3111)  (431)    (541)     (642)

                       (4211)   (5221)    (651)

                       (41111)  (5311)    (6222)

                                (52111)   (6321)

                                (511111)  (6411)

                                          (62211)

                                          (63111)

                                          (621111)

                                          (6111111)

Also the number of integer partitions of n of length n/2. The Heinz numbers of these partitions are given by A340387. For example, the a(2) = 1 through a(14) = 15 partitions (empty columns not shown) are:

  (2)  (22)  (222)  (2222)  (22222)  (222222)  (2222222)

       (31)  (321)  (3221)  (32221)  (322221)  (3222221)

             (411)  (3311)  (33211)  (332211)  (3322211)

                    (4211)  (42211)  (333111)  (3332111)

                    (5111)  (43111)  (422211)  (4222211)

                            (52111)  (432111)  (4322111)

                            (61111)  (441111)  (4331111)

                                     (522111)  (4421111)

                                     (531111)  (5222111)

                                     (621111)  (5321111)

                                     (711111)  (5411111)

                                               (6221111)

                                               (6311111)

                                               (7211111)

                                               (8111111)

(End)

REFERENCES

Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem, Mathematics and Computer Education, Vol. 31, No. 1, pp. 24-28, Winter 1997.  MathEduc Database (Zentralblatt MATH, 1997c.01891).

Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem II,   Missouri Journal of Mathematical Sciences, Vol. 16, No. 1, Winter 2004, pp. 12-17.  Zentralblatt MATH, Zbl 1071.05501.

LINKS

Robert Price, Table of n, a(n) for n = 0..2001

FORMULA

G.f.: Product_{k even} 1/(1 - x^k).

Convolution with the number of partitions into distinct parts (A000009, which is also number of partitions into odd parts) gives the number of partitions (A000041). - Franklin T. Adams-Watters, Jan 06 2006

If n is even then a(n)=A000041(n/2) otherwise a(n)=0. - Omar E. Pol, Nov 20 2009

G.f.: 1 + x^2*(1 - G(0))/(1-x^2) where G(k) =  1 - 1/(1-x^(2*k+2))/(1-x^2/(x^2-1/G(k+1) )); (recursively defined continued fraction). - Sergei N. Gladkovskii, Jan 23 2013

a(n) = A096441(n) - A000009(n), n >= 1. - Omar E. Pol, Aug 16 2013

G.f.: exp(Sum_{k>=1} x^(2*k)/(k*(1 - x^(2*k)))). - Ilya Gutkovskiy, Aug 13 2018

EXAMPLE

From Joerg Arndt, Jun 11 2013: (Start)

There are a(12)=11 symmetric unimodal compositions of 12+2=14 where the maximal part appears twice:

01:  [ 1 1 1 1 1 2 2 1 1 1 1 1 ]

02:  [ 1 1 1 1 3 3 1 1 1 1 ]

03:  [ 1 1 1 4 4 1 1 1 ]

04:  [ 1 1 2 3 3 2 1 1 ]

05:  [ 1 1 5 5 1 1 ]

06:  [ 1 2 4 4 2 1 ]

07:  [ 1 6 6 1 ]

08:  [ 2 2 3 3 2 2 ]

09:  [ 2 5 5 2 ]

10:  [ 3 4 4 3 ]

11:  [ 7 7 ]

There are a(14)=15 symmetric unimodal compositions of 14 where the maximal part appears an even number of times:

01:  [ 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ]

02:  [ 1 1 1 1 1 2 2 1 1 1 1 1 ]

03:  [ 1 1 1 1 3 3 1 1 1 1 ]

04:  [ 1 1 1 2 2 2 2 1 1 1 ]

05:  [ 1 1 1 4 4 1 1 1 ]

06:  [ 1 1 2 3 3 2 1 1 ]

07:  [ 1 1 5 5 1 1 ]

08:  [ 1 2 2 2 2 2 2 1 ]

09:  [ 1 2 4 4 2 1 ]

10:  [ 1 3 3 3 3 1 ]

11:  [ 1 6 6 1 ]

12:  [ 2 2 3 3 2 2 ]

13:  [ 2 5 5 2 ]

14:  [ 3 4 4 3 ]

15:  [ 7 7 ]

(End)

a(8)=5 because we  have [8], [6,2], [4,4], [4,2,2], and [2,2,2,2]. - Emeric Deutsch, Jan 27 2016

From Gus Wiseman, May 22 2021: (Start)

The a(0) = 1 through a(12) = 11 partitions into even parts are the following (empty columns shown as dots, A = 10, C = 12). The Heinz numbers of these partitions are given by A066207.

  ()  .  (2)  .  (4)   .  (6)    .  (8)     .  (A)      .  (C)

                 (22)     (42)      (44)       (64)        (66)

                          (222)     (62)       (82)        (84)

                                    (422)      (442)       (A2)

                                    (2222)     (622)       (444)

                                               (4222)      (642)

                                               (22222)     (822)

                                                           (4422)

                                                           (6222)

                                                           (42222)

                                                           (222222)

(End)

MAPLE

ZL:= [S, {C = Cycle(B), S = Set(C), E = Set(B), B = Prod(Z, Z)}, unlabelled]: seq(combstruct[count](ZL, size=n), n=0..69); # Zerinvary Lajos, Mar 26 2008

g := 1/mul(1-x^(2*k), k = 1 .. 100): gser := series(g, x = 0, 80): seq(coeff(gser, x, n), n = 0 .. 78); # Emeric Deutsch, Jan 27 2016

# Using the function EULER from Transforms (see link at the bottom of the page).

[1, op(EULER([0, 1, seq(irem(n, 2), n=0..66)]))]; # Peter Luschny, Aug 19 2020

# next Maple program:

a:= n-> `if`(n::odd, 0, combinat[numbpart](n/2)):

seq(a(n), n=0..84);  # Alois P. Heinz, Jun 22 2021

MATHEMATICA

nmax = 50; s = Range[2, nmax, 2];

Table[Count[IntegerPartitions@n, x_ /; SubsetQ[s, x]], {n, 0, nmax}] (* Robert Price, Aug 05 2020 *)

CROSSREFS

Bisection (even part) gives the partition numbers A000041.

Column k=0 of A103919, A264398.

Cf. A036469, A000070.

Cf. A135010, A138121.

Note: A-numbers of ranking sequences are in parentheses below.

The version for odd instead of even parts is A000009 (A066208).

The version for parts divisible by 3 instead of 2 is A035377.

The strict case is A035457.

The Heinz numbers of these partitions are given by A066207.

The ordered version (compositions) is A077957 prepended by (1,0).

This is column k = 2 of A168021.

The multiplicative version (factorizations) is A340785.

A000569 counts graphical partitions (A320922).

A004526 counts partitions of length 2 (A001358).

A025065 counts palindromic partitions (A265640).

A027187 counts partitions with even length/maximum (A028260/A244990).

A058696 counts partitions of even numbers (A300061).

A067661 counts strict partitions of even length (A030229).

A236913 counts partitions of even length and sum (A340784).

A340601 counts partitions of even rank (A340602).

The following count partitions of even length:

- A096373 cannot be partitioned into strict pairs (A320891).

- A338914 can be partitioned into strict pairs (A320911).

- A338915 cannot be partitioned into distinct pairs (A320892).

- A338916 can be partitioned into distinct pairs (A320912).

- A339559 cannot be partitioned into distinct strict pairs (A320894).

- A339560 can be partitioned into distinct strict pairs (A339561).

Cf. A000041, A000290, A087897, A100484, A110618, A209816, A210249, A233771, A339004, A340385, A340387, A340786, A341447.

Sequence in context: A240144 A240145 A240146 * A241645 A266774 A079977

Adjacent sequences:  A035360 A035361 A035362 * A035364 A035365 A035366

KEYWORD

nonn,easy

AUTHOR

Olivier Gérard

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 06:54 EDT 2022. Contains 353933 sequences. (Running on oeis4.)