cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A119416 n * (smallest prime greater than largest prime factor of n).

Original entry on oeis.org

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
Offset: 1

Views

Author

Reinhard Zumkeller, May 17 2006

Keywords

Comments

a(n) = n * A117366(n);
A000005(a(n)) = 2*A000005(n) = A062011(n).

Examples

			a(10) = (2*5)*7.
		

Crossrefs

Programs

  • Haskell
    a119416 n = n * (a151800 $ a006530 n) -- Reinhard Zumkeller, Apr 06 2015
  • Mathematica
    Insert[Table[n*Prime[PrimePi[FactorInteger[n][[ -1]][[1]]] + 1],{n,2,100}], 2, 1] (* Stefan Steinerberger, May 18 2006 *)

Formula

a(n) = n * A151800(A006530(n)). - Reinhard Zumkeller, Apr 06 2015