|
%I #17 Sep 08 2022 08:46:08
%S 4,7,9,14,18,19,23,24,27,29,34,38,39,44,49,54,58,59,61,64,66,68,69,71,
%T 74,79,82,84,89,94,97,99,103,104,109,114,119,120,124,127,128,129,130,
%U 134,136,139,140,142,144,149,154,159,163,164,165,169,170,173,174
%N Numbers m such that 5 divides A000041(m).
%H Bruno Berselli, <a href="/A243935/b243935.txt">Table of n, a(n) for n = 1..1000</a>
%t Select[Range[200], Mod[PartitionsP[#], 5] == 0 &]
%o (Sage)
%o # From _Peter Luschny_ in A000041
%o @CachedFunction
%o def A000041(n):
%o if n == 0: return 1
%o S = 0; J = n-1; k = 2
%o while 0 <= J:
%o T = A000041(J)
%o S = S+T if is_odd(k//2) else S-T
%o J -= k if is_odd(k) else k//2
%o k += 1
%o return S
%o [n for n in (0..200) if mod(A000041(n),5) == 0]
%o (Magma) [n: n in [1..200] | IsZero(NumberOfPartitions(n) mod 5)];
%o (PARI) is(n)=numbpart(n)%5==0 \\ _Charles R Greathouse IV_, Apr 08 2015
%Y Numbers m such that k divides A000041(m), where k is prime: A001560 (k=2), A083214 (k=3), this sequence (k=5), A243936 (k=7), A027827 (k=11), A071750 (k=13). For k composite: A237278 (k=4), A035700 (k=12).
%K nonn,easy
%O 1,1
%A _Bruno Berselli_, Jun 15 2014
|
