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!)
A084191 a(n) = A084190(A084190(n)). 2

%I #12 Dec 16 2021 07:37:53

%S 1,1,1,2,3,36,10,60,21,157080,36,2394591020640,330,438900,702,185640,

%T 105,392201962392240,680,47347883887966200,450574740,3183089069160,210

%N a(n) = A084190(A084190(n)).

%C Next term: a(24) = A084190(53130) > 10^91.

%C B-file goes up to n=59 because a(60) has 1503 digits. - _Robert Israel_, Sep 04 2019

%H Robert Israel, <a href="/A084191/b084191.txt">Table of n, a(n) for n = 1..59</a>

%p A084190:= n -> ilcm(op(map(`-`,numtheory:-divisors(n) minus {1},1))):

%p map(A084190@A084190,[$1..30]); # _Robert Israel_, Sep 04 2019

%t b[n_] := LCM @@ (Rest[Divisors[n]] - 1);

%t a[n_] := If[n <= 2, 1, b@b@n];

%t Array[a, 59] (* _Jean-François Alcover_, Dec 16 2021 *)

%Y Cf. A084190.

%K nonn

%O 1,4

%A _Reinhard Zumkeller_, May 18 2003

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 July 22 18:05 EDT 2024. Contains 374540 sequences. (Running on oeis4.)