This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A217725 #19 May 07 2013 20:44:21 %S A217725 1,3,6,27,77,98,251,315,602,913,2462,5203,6237,15035,34705,77231, %T A217725 143044,166364,224301,348326,464704,617547,710869,939441,1417900, %U A217725 2769730,4101251,5308732,9999185,18533944,26646186,33845975,54249790,60960273,108389248 %N A217725 Numbers n such that 5n is a partition number. %F A217725 a(j) = A225325(j)/5. %e A217725 3 is in the sequence because 5*3 = 15 and 15 is a partition number: p(7) = A000041(7) = 15. %t A217725 Select[PartitionsP[Range[300]], Mod[#, 5] == 0 &]/5 (* _T. D. Noe_, May 05 2013 *) %Y A217725 Cf. A000041, A213179, A213365, A216258, A217726, A222175, A222178, A222179, A225317, A225323, A225325. %K A217725 nonn %O A217725 1,2 %A A217725 _Omar E. Pol_, May 05 2013 %E A217725 a(9)-a(35) from _R. J. Mathar_, May 05 2013