|
%I #9 May 09 2017 17:36:24
%S 0,2,5,7,9,23,14,29,12,31,20,80,27,40,31,121,35,80,44,94,40,50,54,302,
%T 18,61,38,109,65,499,77,497,50,73,40,668,90,86,61,328,104,532,119,125,
%U 94,100,135,1178,25,94,73,142,152,302,50,355,86,115,170,1894,189,131,109,2017,61,566,209,160,100,532,230,2630,252,148,94,179,50,601,275,1228,138
%N Compound filter: a(n) = P(A061395(n), A046523(n)), where P(n,k) is sequence A000027 used as a pairing function.
%H Antti Karttunen, <a href="/A286356/b286356.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PairingFunction.html">Pairing Function</a>
%F a(n) = (1/2)*(2 + ((A061395(n)+A046523(n))^2) - A061395(n) - 3*A046523(n)).
%o (PARI)
%o 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 A061395(n) = if(1==n, 0, primepi(vecmax(factor(n)[, 1]))); \\ After _M. F. Hasler_'s code for A006530.
%o A286356(n) = (2 + ((A061395(n)+A046523(n))^2) - A061395(n) - 3*A046523(n))/2;
%o for(n=1, 10000, write("b286356.txt", n, " ", A286356(n)));
%o (Scheme) (define (A286356 n) (* (/ 1 2) (+ (expt (+ (A061395 n) (A046523 n)) 2) (- (A061395 n)) (- (* 3 (A046523 n))) 2)))
%o (Python)
%o from sympy import factorint
%o from operator import mul
%o def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
%o def P(n):
%o f = factorint(n)
%o return sorted([f[i] for i in f])
%o def a046523(n):
%o x=1
%o while True:
%o if P(n) == P(x): return x
%o else: x+=1
%o def a061395(n): return 0 if n == 1 else primepi(max(primefactors(n)))
%o def a(n): return T(a061395(n), a046523(n)) # _Indranil Ghosh_, May 09 2017
%Y Cf. A000027, A046523, A061395, A286164.
%K nonn
%O 1,2
%A _Antti Karttunen_, May 09 2017
|
