# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a275468
Showing 1-1 of 1

%I A275468 #9 Mar 20 2018 19:01:20
%S A275468 1,2,2,4,2,6,2,8,4,6,2,12,2,6,6,16,2,12,2,12,6,6,2,24,4,6,8,12,2,30,2,
%T A275468 6,6,6,6,36,2,6,6,24,2,30,2,12,18,6,2,45,4,18,6,12,2,24,6,24,6,6,2,60,
%U A275468 2,6,18,64,6,30,2,12,6,30,2,72,2,6,12,12,6,30,2,48,16,6,2,60,6,6,6,24
%N A275468 Least k such that d(k*n^2) = d(n*k^2) where d = A000005.
%C A275468 Numbers n such that a(n) is different from A046523(n) are 32, 45, 48, 50, 63, ...
%H A275468 Antti Karttunen, <a href="/A275468/b275468.txt">Table of n, a(n) for n = 1..65537</a>
%e A275468 a(32) = 6 because A000005(6*32^2) = A000005(32*6^2).
%o A275468 (PARI) a(n) = {my(k = 1); while (numdiv(k*n^2) != numdiv(n*k^2), k++); k; }
%Y A275468 Cf. A000005, A046523.
%K A275468 nonn
%O A275468 1,2
%A A275468 _Altug Alkan_, Jul 28 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE