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!)
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). 2

%I

%S 1,2,3,4,10,12,28,32,144,480,1056,1152,4992,5376,11520,36864,208896,

%T 221184,1400832,1474560,6193152,19464192,40697856,42467328,353894400,

%U 1840250880,3822059520,21403533312,88671780864,91729428480,568722456576

%N 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).

%H Harvey P. Dale, <a href="/A100773/b100773.txt">Table of n, a(n) for n = 1..1000</a>

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

%t 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 *)

%Y Cf. A002639.

%K easy,nonn

%O 1,2

%A _Amarnath Murthy_, Nov 28 2004

%E Extended by _Ray Chandler_, Dec 10 2004

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 August 12 23:52 EDT 2022. Contains 356077 sequences. (Running on oeis4.)