|
| |
|
|
A070229
|
|
Next m>n such that m is divisible by lpf(n), lpf=A006530 largest prime factor.
|
|
3
| |
|
|
2, 4, 6, 6, 10, 9, 14, 10, 12, 15, 22, 15, 26, 21, 20, 18, 34, 21, 38, 25, 28, 33, 46, 27, 30, 39, 30, 35, 58, 35, 62, 34, 44, 51, 42, 39, 74, 57, 52, 45, 82, 49, 86, 55, 50, 69, 94, 51, 56, 55, 68, 65, 106, 57, 66, 63, 76, 87, 118, 65, 122
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
| a(n)=(n/lpf(n)+1)*lpf(n).
a(n) = n+lpf(n) where lpf=A006530 largest prime factor. For example, a(14)=14+7=21 (instead of ((14/7)+1))*7) - Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Jun 14 2007
|
|
|
MATHEMATICA
| Table[n + Last@(First/@FactorInteger[n]), {n, 70}] (* From Vladimir Joseph Stephan Orlovsky, Apr 08 2011 *)
|
|
|
PROG
| (Haskell)
a070229 n = head $ dropWhile (<= n) [lpf, 2*lpf..] where lpf = a006530 n
-- Reinhard Zumkeller, Nov 14 2011
|
|
|
CROSSREFS
| Cf. A036441.
Sequence in context: A056942 A115947 A061228 * A053568 A037225 A060685
Adjacent sequences: A070226 A070227 A070228 * A070230 A070231 A070232
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 07 2002
|
| |
|
|
