login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096967 Bisection of A096441. 2
0, 2, 4, 7, 11, 17, 26, 37, 54, 76, 106, 145, 199, 266, 357, 472, 621, 809, 1053, 1354, 1740, 2218, 2818, 3559, 4485, 5616, 7018, 8728, 10826, 13373, 16484, 20236, 24793, 30275, 36886, 44810, 54329, 65683, 79265, 95419, 114650, 137447, 164496, 196445, 234221 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Number of partitions of 2n such that either all parts are odd or all parts are even, n >= 1. - Omar E. Pol, Aug 16 2013

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..1000

MAPLE

b:= proc(n, i) option remember; `if`(i>n, 0,

      `if`(irem(n, i)=0, 1, 0)+add(`if`(irem(j, 2)=0,

       b(n-i*j, i+1), 0), j=0..n/i))

    end:

a:= n-> b(2*n, 1):

seq(a(n), n=0..60);  # Alois P. Heinz, Mar 26 2014

MATHEMATICA

b[n_, i_] := b[n, i] = If[i>n, 0, If[Mod[n, i]==0, 1, 0] + Sum[If[Mod[j, 2] ==0, b[n-i*j, i+1], 0], {j, 0, n/i}]]; a[n_] := b[2*n, 1]; Table[a[n], {n, 0, 60}] (* Jean-Fran├žois Alcover, Jan 17 2016, after Alois P. Heinz *)

CROSSREFS

Cf. A096441, A078408.

Sequence in context: A289177 A249039 A280962 * A117276 A035295 A289010

Adjacent sequences:  A096964 A096965 A096966 * A096968 A096969 A096970

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Aug 20 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 16:44 EDT 2020. Contains 334626 sequences. (Running on oeis4.)