login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = lcm(n, d(n)).
10

%I #20 Oct 27 2023 19:28:08

%S 1,2,6,12,10,12,14,8,9,20,22,12,26,28,60,80,34,18,38,60,84,44,46,24,

%T 75,52,108,84,58,120,62,96,132,68,140,36,74,76,156,40,82,168,86,132,

%U 90,92,94,240,147,150,204,156,106,216,220,56,228,116,118,60,122,124,126,448

%N a(n) = lcm(n, d(n)).

%C Fixed points of this sequence are the refactorable numbers (A033950), i.e. a(A033950(n)) = A033950(n). - _Labos Elemer_, Nov 18 2002

%H Alois P. Heinz, <a href="/A009230/b009230.txt">Table of n, a(n) for n = 1..20000</a> (first 1000 terms from T. D. Noe)

%p a:= n-> ilcm(n, numtheory[tau](n)):

%p seq(a(n), n=1..100); # _Alois P. Heinz_, Jan 14 2017

%t Table[LCM[n,DivisorSigma[0,n]],{n,70}] (* _Harvey P. Dale_, Jul 31 2016 *)

%Y Cf. A000005, A033950.

%K nonn

%O 1,2

%A _David W. Wilson_