cp's OEIS Frontend

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.

A121015 Numbers n such that partition number p(n) == 14 (mod n).

This page as a plain text file.
%I A121015 #18 Mar 14 2015 18:43:18
%S A121015 1,2,8,1402,3579,4111,5289,6383,6467,15146,32141,41910,82849,110088,
%T A121015 127531,185114,1320338,1467242,5739729,22507473,32494198
%N A121015 Numbers n such that partition number p(n) == 14 (mod n).
%C A121015 No other terms below 10^8. - _Max Alekseyev_, May 19 2014
%e A121015 Partition number of 8 is 22 = 1*8 + 14, hence 8 is a term.
%e A121015 Partition number of 1402 is 52435757789401123913939450130086135644 = 37400683159344596229628709079947315*1402 + 14, hence 1402 is a term.
%t A121015 Do[ If[ Mod[ PartitionsP@n - 14, n] == 0, Print@n], {n, 731000}] (* _Robert G. Wilson v_, Sep 14 2006 *)
%o A121015 (PARI) for(n=1,200000,if((numbpart(n)-14)%n==0,print1(n,","))) \\ _Klaus Brockhaus_, Sep 07 2006
%Y A121015 Cf. A000041, A051177, A093952, A128836, A203023.
%K A121015 more,nonn
%O A121015 1,2
%A A121015 _Zak Seidov_, Sep 02 2006
%E A121015 Edited, corrected and extended (a(1) to a(3), a(11) to a(16)) by _Klaus Brockhaus_, Sep 07 2006
%E A121015 Rechecked by _Klaus Brockhaus_, Mar 17 2007
%E A121015 a(17)-a(19) from _Ryan Propper_, Mar 17 2007
%E A121015 a(20) from _Max Alekseyev_, Dec 28 2011
%E A121015 a(21) from _Max Alekseyev_, Jan 15 2013