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 A225323 #16 May 10 2013 16:21:20 %S A225323 1,2,7,16,21,27,35,57,72,178,338,415,622,759,1353,1967,2365,2835,4053, %T A225323 4834,5751,15775,18566,21813,25599,35105,47893,65020,75620,101955, %U A225323 118196,158330,490253,644500,738024,1102924,1636757,1864205,2121679,2413060,2742487,3535243,8424520,10737664,13654376,27709215,31120519 %N A225323 Numbers n such that 11n is a partition number. %F A225323 a(j) = A225361(j)/11. %e A225323 2 is in the sequence because 11*2 = 22 and 22 is a partition number: p(8) = A000041(8) = 22. %t A225323 Select[PartitionsP[Range[100]], Mod[#, 11] == 0 &]/11 (* _T. D. Noe_, May 05 2013 *) %Y A225323 Cf. A000041, A027827, A213179, A213365, A216258, A217725, A217726, A222175, A222178, A222179, A225317, A225361. %K A225323 nonn %O A225323 1,2 %A A225323 _Omar E. Pol_, May 05 2013 %E A225323 a(11)-a(47) from _R. J. Mathar_, May 05 2013