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

Search: id:a050325
Showing 1-1 of 1

%I A050325 #18 Jun 30 2023 03:51:22
%S A050325 1,1,1,2,1,2,1,2,5,1,3,2,6,1,3,2,6,1,3,9,2,15,4,6,1,3,10,2,21,4,6,1,3,
%T A050325 10,2,22,4,16,6,1,13,3,35,5,10,2,22,4,19,6,1,14,3,52,41,5,10,2,22,4,
%U A050325 20,6,1,14,3,83,42,5,26,10,2,66,17,22,4,20,55,6,6,1,14,3,93
%N A050325 Number of factorizations into squarefree factors indexed by prime signatures: A050320(A025487).
%H A050325 Amiram Eldar, <a href="/A050325/b050325.txt">Table of n, a(n) for n = 1..3300</a>
%F A050325 a(n) = A050320(A025487(n)).
%p A050325 read(transforms):
%p A050325 a050320 := BFILETOLIST("b050320.txt") :
%p A050325 for n from 1 do
%p A050325     a050325 := a050320[A025487(n)] ;
%p A050325     printf("%d %d\n",n,a050325) ;
%p A050325 end do: # _R. J. Mathar_, May 26 2017
%t A050325 a050320 = Cases[Import["https://oeis.org/A050320/b050320.txt", "Table"], {_, _}][[All, 2]];
%t A050325 lpe = {}; a025487 = {1};
%t A050325 Do[pe = Sort[FactorInteger[n][[All, 2]]]; If[FreeQ[lpe, pe], AppendTo[lpe, pe]; AppendTo[a025487, n]], {n, 2, 10^4}];
%t A050325 A050325[n_] := a050320[[a025487[[n]]]];
%t A050325 Array[A050325, 83] (* _Jean-François Alcover_, Apr 06 2020 *)
%Y A050325 Cf. A025487, A050320.
%K A050325 nonn
%O A050325 1,4
%A A050325 _Christian G. Bower_, Oct 15 1999

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