cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A329379 a(n) = n/A093411(n), where A093411(n) is obtained by repeatedly dividing n by the largest factorial that divides it until an odd number is reached.

This page as a plain text file.
%I A329379 #5 Nov 15 2019 21:33:18
%S A329379 1,2,1,4,1,6,1,8,1,2,1,12,1,2,1,16,1,6,1,4,1,2,1,24,1,2,1,4,1,6,1,32,
%T A329379 1,2,1,36,1,2,1,8,1,6,1,4,1,2,1,48,1,2,1,4,1,6,1,8,1,2,1,12,1,2,1,64,
%U A329379 1,6,1,4,1,2,1,24,1,2,1,4,1,6,1,16,1,2,1,12,1,2,1,8,1,6,1,4,1,2,1,96,1,2,1,4,1,6,1,8,1
%N A329379 a(n) = n/A093411(n), where A093411(n) is obtained by repeatedly dividing n by the largest factorial that divides it until an odd number is reached.
%H A329379 Antti Karttunen, <a href="/A329379/b329379.txt">Table of n, a(n) for n = 1..40319</a>
%F A329379 a(n) = n/A093411(n).
%o A329379 (PARI)
%o A329379 A076934(n) = for(k=2, oo , if(n%k, return(n), n /= k));
%o A329379 A093411(n) = if(!n,n,my(u=A076934(n)); if(n%2, return(n), return(A093411(u))));
%o A329379 A329379(n) = (n/A093411(n));
%Y A329379 Cf. A000142, A076934, A093411.
%Y A329379 Cf. also A328479.
%K A329379 nonn
%O A329379 1,2
%A A329379 _Antti Karttunen_, Nov 15 2019