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.

A100773 a(1) = 1, a(2) = (2*1)/1 = 2. a(n+1) = (n+1)*a(n) divided by the largest prime divisor of a(n).

Original entry on oeis.org

1, 2, 3, 4, 10, 12, 28, 32, 144, 480, 1056, 1152, 4992, 5376, 11520, 36864, 208896, 221184, 1400832, 1474560, 6193152, 19464192, 40697856, 42467328, 353894400, 1840250880, 3822059520, 21403533312, 88671780864, 91729428480, 568722456576
Offset: 1

Views

Author

Amarnath Murthy, Nov 28 2004

Keywords

Examples

			a(6) = 12, a(7) = (7*12)/3 = 28.
		

Crossrefs

Cf. A002639.

Programs

  • Mathematica
    nxt[{n_,a_}]:={n+1,(a(n+1))/FactorInteger[a][[-1,1]]}; NestList[nxt,{1,1},30][[All,2]] (* Harvey P. Dale, Sep 20 2019 *)

Extensions

Extended by Ray Chandler, Dec 10 2004