Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 May 21 2022 08:42:27
%S 28,62,84,94,129,136,173,180,197,213,219,226,227,237,240,264,294,311,
%T 318,326,335,338,357,358,389,418,453,458,473,482,484,486,508,529,538,
%U 542,562,600,635,644,668,670,684,697,699,713,714,727,742,747,751,778
%N Numbers k such that 13 divides p(k), the k-th partition number, A000041(k).
%H Amiram Eldar, <a href="/A071750/b071750.txt">Table of n, a(n) for n = 1..1000</a>
%t Select[ Range[800], Mod[ PartitionsP[ # ], 13] == 0 &]
%o (PARI) \ps800 for(n=0,600,if(polcoeff(1/eta(x),n,x)%13==0,print1(n,",")))
%o (PARI) is(n)=numbpart(n)%13==0 \\ _Charles R Greathouse IV_, Apr 08 2015
%Y Cf. A000041, A027827, A243935 (see crossrefs).
%K nonn,easy
%O 1,1
%A _Benoit Cloitre_, Jun 24 2002
%E Edited by _Robert G. Wilson v_, Jun 27 2002