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!)
 A328989 Number of partitions of n with rank congruent to 1 mod 3. 2

%I

%S 0,1,1,1,3,4,4,8,10,13,20,26,32,46,59,75,101,129,161,211,264,331,421,

%T 526,649,815,1004,1235,1526,1869,2275,2787,3382,4097,4967,5994,7205,

%U 8678,10396,12437,14869,17727,21076,25067,29713,35174,41596,49094,57827,68087

%N Number of partitions of n with rank congruent to 1 mod 3.

%H Alois P. Heinz, <a href="/A328989/b328989.txt">Table of n, a(n) for n = 1..10000</a>

%H Elaine Hou, and Meena Jagadeesan, <a href="https://arxiv.org/abs/1607.03846">Dyson’s partition ranks and their multiplicative extensions</a>, arXiv:1607.03846 [math.NT], 2016; The Ramanujan Journal 45.3 (2018): 817-839. See Table 3.

%F a(n) = (A000041(n) - A328988(n))/2. - _Alois P. Heinz_, Nov 11 2019

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

%p `if`(irem(r+n, 3)=0, 1, 0), b(n, i-1, r)+

%p b(n-i, min(n-i, i), irem(r+1, 3)))

%p end:

%p a:= proc(n) option remember; add(

%p b(n-i, min(n-i, i), modp(2-i, 3)), i=1..n)

%p end:

%p seq(a(n), n=1..60); # _Alois P. Heinz_, Nov 11 2019

%t b[n_, i_, r_] := b[n, i, r] = If[n == 0 || i == 1, If[Mod[r + n, 3] == 0, 1, 0], b[n, i - 1, r] + b[n - i, Min[n - i, i], Mod[r + 1, 3]]];

%t a[n_] := a[n] = Sum[b[n - i, Min[n - i, i], Mod[2 - i, 3]], {i, 1, n}];

%t Array[a, 60] (* _Jean-François Alcover_, Feb 29 2020, after _Alois P. Heinz_ *)

%Y Cf. A000041, A328988.

%K nonn

%O 1,5

%A _N. J. A. Sloane_, Nov 09 2019

%E a(22)-a(50) from _Lars Blomberg_, Nov 11 2019

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 27 09:09 EDT 2020. Contains 337380 sequences. (Running on oeis4.)