|
Search: id:A135058
|
|
|
| A135058 |
|
Least m such that both m and m+n have exactly n prime factors, ignoring multiplicity. |
|
+0
5
|
|
| 1, 2, 10, 102, 1326, 96135, 607614, 159282123, 9617162170, 1110180535035, 28334309296920, 16513791577659519, 271518698440871310
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(13) <= 592357638037885411965. If we change "exactly n" to "at least n", the sequence is still the same at least through a(12).
|
|
EXAMPLE
|
a(3) = 102 because 102 and 105 each have three prime factors.
|
|
CROSSREFS
|
Cf. A097978, A098515.
Sequence in context: A036336 A070842 A086927 this_sequence A005799 A000595 A087234
Adjacent sequences: A135055 A135056 A135057 this_sequence A135059 A135060 A135061
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
David Wasserman (dwasserm(AT)earthlink.net), Feb 11 2008
|
|
|
Search completed in 0.002 seconds
|
