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!)
A096967 Bisection of A096441. 2

%I #14 Jan 17 2016 04:17:52

%S 0,2,4,7,11,17,26,37,54,76,106,145,199,266,357,472,621,809,1053,1354,

%T 1740,2218,2818,3559,4485,5616,7018,8728,10826,13373,16484,20236,

%U 24793,30275,36886,44810,54329,65683,79265,95419,114650,137447,164496,196445,234221

%N Bisection of A096441.

%C 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

%H Alois P. Heinz, <a href="/A096967/b096967.txt">Table of n, a(n) for n = 0..1000</a>

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

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

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

%p end:

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

%p seq(a(n), n=0..60); # _Alois P. Heinz_, Mar 26 2014

%t 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_ *)

%Y Cf. A096441, A078408.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Aug 20 2004

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 April 24 11:21 EDT 2024. Contains 371936 sequences. (Running on oeis4.)