OFFSET
1,1
LINKS
Bruno Berselli, Table of n, a(n) for n = 1..1000
MATHEMATICA
Select[Range[200], Mod[PartitionsP[#], 5] == 0 &]
PROG
(Sage)
# From Peter Luschny in A000041
@CachedFunction
def A000041(n):
if n == 0: return 1
S = 0; J = n-1; k = 2
while 0 <= J:
T = A000041(J)
S = S+T if is_odd(k//2) else S-T
J -= k if is_odd(k) else k//2
k += 1
return S
[n for n in (0..200) if mod(A000041(n), 5) == 0]
(Magma) [n: n in [1..200] | IsZero(NumberOfPartitions(n) mod 5)];
(PARI) is(n)=numbpart(n)%5==0 \\ Charles R Greathouse IV, Apr 08 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Bruno Berselli, Jun 15 2014
STATUS
approved