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!)
A340508 Let ped(n) denote the number of partitions of n in which the even parts are distinct (A001935); a(n) = ped(9*n+7). 1

%I #30 Jan 29 2021 08:13:12

%S 12,132,876,4416,18624,69060,232044,720648,2097612,5781120,15203904,

%T 38387556,93503052,220586244,505673280,1129518564,2464116480,

%U 5260683840,11010018840,22623235620,45700246668,90863466372,178000194348,343888491684,655760533632,1235186054724

%N Let ped(n) denote the number of partitions of n in which the even parts are distinct (A001935); a(n) = ped(9*n+7).

%C These are the coefficients in the left-hand side of a "surprising identity" [Hirschhorn].

%D M. D. Hirschhorn, The Power of q, Springer, 2017. See (33.1.3) page 303.

%H Alois P. Heinz, <a href="/A340508/b340508.txt">Table of n, a(n) for n = 0..5000</a>

%F a(n) = 12 * A226034(n).

%p with(numtheory):

%p b:= proc(n) option remember; `if`(n=0, 1, add(b(n-j)*add(

%p `if`(irem(d, 4)=0, 0, d), d=divisors(j)), j=1..n)/n)

%p end:

%p a:= n-> b(9*n+7):

%p seq(a(n), n=0..25); # _Alois P. Heinz_, Jan 26 2021

%t b[n_] := b[n] = If[n == 0, 1, Sum[b[n - j]*Sum[

%t If[Mod[d, 4] == 0, 0, d], {d, Divisors[j]}], {j, 1, n}]/n];

%t a[n_] := b[9n+7];

%t a /@ Range[0, 25] (* _Jean-François Alcover_, Jan 29 2021, after _Alois P. Heinz_ *)

%Y A subsequence of A001935.

%Y Cf. A226034.

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Jan 26 2021

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 July 2 10:20 EDT 2024. Contains 373956 sequences. (Running on oeis4.)