|
| |
|
|
A052022
|
|
Smallest number m such that n-th prime p = sum of digits of m and p = largest prime factor of m (or 0 if no such number exists).
|
|
6
| |
|
|
12, 50, 70, 308, 364, 476, 1729, 4784, 9947, 8959, 38998, 588965, 179998, 1879859, 5988788, 38778989, 79693999, 287978998
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| p=43 -> a(13)=179998 -> 1+7+9+9+9+8 = '43' and 179998 = 2.7.13.23.'43'. p=47 -> a(14)=1879859 -> 1+8+7+9+8+5+9 = '47' and 1879859 = 23.37.47.'47'.
|
|
|
CROSSREFS
| Cf. A052018, A052019, A052020, A052021, A007953, A005349, A028834.
Sequence in context: A041274 A029586 A081292 * A110907 A009937 A009932
Adjacent sequences: A052019 A052020 A052021 * A052023 A052024 A052025
|
|
|
KEYWORD
| nonn,base,nice
|
|
|
AUTHOR
| Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.
|
|
|
EXTENSIONS
| Does there exist a solution for every prime p?
|
| |
|
|
