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.

Showing 1-3 of 3 results.

A128836 Numbers k such that partition number p(k) == 1 (mod k).

Original entry on oeis.org

1, 4, 7, 11, 54, 55, 115, 146, 157, 234, 239, 951, 272732, 419192, 7626972, 38355152
Offset: 1

Views

Author

Keywords

Comments

Numbers k such that A093952(k) = 1.
There are no other terms below 10^8. - Max Alekseyev, May 19 2014

Crossrefs

Extensions

a(16) from Max Alekseyev, Jan 15 2013

A259943 Integers n dividing A000009(n)+1.

Original entry on oeis.org

1, 2, 3, 9, 31, 169, 53281, 10984777, 12245367, 19806045
Offset: 1

Views

Author

Max Alekseyev, Jul 10 2015

Keywords

Comments

No other terms below 10^8.

Crossrefs

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

Original entry on oeis.org

1, 2, 8, 1402, 3579, 4111, 5289, 6383, 6467, 15146, 32141, 41910, 82849, 110088, 127531, 185114, 1320338, 1467242, 5739729, 22507473, 32494198
Offset: 1

Views

Author

Zak Seidov, Sep 02 2006

Keywords

Comments

No other terms below 10^8. - Max Alekseyev, May 19 2014

Examples

			Partition number of 8 is 22 = 1*8 + 14, hence 8 is a term.
Partition number of 1402 is 52435757789401123913939450130086135644 = 37400683159344596229628709079947315*1402 + 14, hence 1402 is a term.
		

Crossrefs

Programs

  • Mathematica
    Do[ If[ Mod[ PartitionsP@n - 14, n] == 0, Print@n], {n, 731000}] (* Robert G. Wilson v, Sep 14 2006 *)
  • PARI
    for(n=1,200000,if((numbpart(n)-14)%n==0,print1(n,","))) \\ Klaus Brockhaus, Sep 07 2006

Extensions

Edited, corrected and extended (a(1) to a(3), a(11) to a(16)) by Klaus Brockhaus, Sep 07 2006
Rechecked by Klaus Brockhaus, Mar 17 2007
a(17)-a(19) from Ryan Propper, Mar 17 2007
a(20) from Max Alekseyev, Dec 28 2011
a(21) from Max Alekseyev, Jan 15 2013
Showing 1-3 of 3 results.