login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119416 n * (smallest prime greater than largest prime factor of n). 3
2, 6, 15, 12, 35, 30, 77, 24, 45, 70, 143, 60, 221, 154, 105, 48, 323, 90, 437, 140, 231, 286, 667, 120, 175, 442, 135, 308, 899, 210, 1147, 96, 429, 646, 385, 180, 1517, 874, 663, 280, 1763, 462, 2021, 572, 315, 1334, 2491, 240, 539, 350, 969, 884, 3127, 270 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) = n * A117366(n);
A000005(a(n)) = 2*A000005(n) = A062011(n).
LINKS
FORMULA
a(n) = n * A151800(A006530(n)). - Reinhard Zumkeller, Apr 06 2015
EXAMPLE
a(10) = (2*5)*7.
MATHEMATICA
Insert[Table[n*Prime[PrimePi[FactorInteger[n][[ -1]][[1]]] + 1], {n, 2, 100}], 2, 1] (* Stefan Steinerberger, May 18 2006 *)
PROG
(Haskell)
a119416 n = n * (a151800 $ a006530 n) -- Reinhard Zumkeller, Apr 06 2015
CROSSREFS
Cf. A151800.
Sequence in context: A215081 A348592 A337737 * A134891 A020947 A011777
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 17 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)