cp's OEIS Frontend

A286479 a(n) = A046523(n+A000005(n)).

%I A286479 #11 May 21 2017 14:32:13
%S A286479 2,4,2,2,2,6,4,12,12,6,2,12,6,12,2,6,2,24,6,6,4,6,4,32,12,30,2,6,2,6,
%T A286479 6,6,2,6,6,12,6,30,2,48,2,12,12,12,6,12,4,6,12,24,6,6,6,6,2,64,2,6,2,
%U A286479 72,12,30,6,2,6,6,6,6,2,30,2,60,12,30,16,6,16,6,16,60,6,6,6,96,2,60,6,96,6,30,6,12,2,12,12,72,12,24,30,2,2,30,30,48,2,30
%N A286479 a(n) = A046523(n+A000005(n)).
%H A286479 Antti Karttunen, <a href="/A286479/b286479.txt">Table of n, a(n) for n = 1..10000</a>
%F A286479 a(n) = A046523(A062249(n)) = A046523(n+A000005(n)).
%t A286479 Table[Times @@ MapIndexed[Prime[First[#2]]^#1 &, Sort[FactorInteger[n + DivisorSigma[0, n]][[All, -1]], Greater]], {n, 106}] (* _Michael De Vlieger_, May 21 2017 *)
%o A286479 (PARI)
%o A286479 A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from _Charles R Greathouse IV_, Aug 17 2011
%o A286479 A286479(n) = A046523(n+numdiv(n));
%o A286479 for(n=1,10000,write("b286479.txt", n, " ", A286479(n)));
%o A286479 (Scheme) (define (A286479 n) (A046523 (+ n (A000005 n))))
%o A286479 (Python)
%o A286479 from sympy import factorint, divisor_count
%o A286479 def P(n):
%o A286479     f = factorint(n)
%o A286479     return sorted([f[i] for i in f])
%o A286479 def a046523(n):
%o A286479     x=1
%o A286479     while True:
%o A286479         if P(n) == P(x): return x
%o A286479         else: x+=1
%o A286479 def a(n): return a046523(n + divisor_count(n)) # _Indranil Ghosh_, May 21 2017
%Y A286479 Cf. A000005, A046523, A062249, A286480, A286529.
%K A286479 nonn
%O A286479 1,1
%A A286479 _Antti Karttunen_, May 21 2017