|
Search: id:A121015
|
|
|
| A121015 |
|
Numbers n such that (partition number of n) == 14 modulo n. |
|
+0
3
|
|
| 1, 2, 8, 1402, 3579, 4111, 5289, 6383, 6467, 15146, 32141, 41910, 82849, 110088, 127531, 185114, 1320338, 1467242, 5739729
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
Partition number of 8 is 22; 22 = 2*8 + 6 and 14 = 1*8 + 6, hence 8 is a term.
Partition number of 1402 is 52435757789401123913939450130086135644 = 37400683159344596229628709079947315*1402 + 14 and 14 = 0*1402 + 14, hence 1402 is a term.
|
|
MATHEMATICA
|
Do[ If[ Mod[ PartitionsP@n - 14, n] == 0, Print@n], {n, 731000}] - Robert G. Wilson v Sep 14 2006
|
|
PROGRAM
|
(PARI) for(n=1, 200000, if((numbpart(n)-14)%n==0, print1(n, ", "))) - (Klaus Brockhaus, Sep 07 2006)
|
|
CROSSREFS
|
Cf. A000041 (partition numbers), A093952 (A000041(n) mod n).
Sequence in context: A084148 A014115 A014116 this_sequence A073630 A027733 A054874
Adjacent sequences: A121012 A121013 A121014 this_sequence A121016 A121017 A121018
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Sep 02 2006
|
|
EXTENSIONS
|
Edited, corrected and extended (a(1) to a(3), a(11) to a(16)) by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Sep 07 2006
Rechecked by Klaus Brockhaus, Mar 17 2007
a(17) - a(19) from Ryan Propper (rpropper(AT)stanford.edu), Mar 17 2007
|
|
|
Search completed in 0.002 seconds
|
