OFFSET
1,2
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
MathWorld, Pairing Function
MATHEMATICA
Table[(2 + (#1 + #2)^2 - #1 - 3 #2)/2 - Boole[n == 1] & @@ {Module[{i = 1}, While[! CoprimeQ[Prime@ i, n], i++]; i], Times @@ MapIndexed[ Prime[First@ #2]^#1 &, Sort[FactorInteger[n][[All, -1]], Greater]]}, {n, 92}] (* Michael De Vlieger, May 04 2017 *)
PROG
(PARI)
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
A257993(n) = { for(i=1, n, if(n%prime(i), return(i))); }
for(n=1, 10000, write("b286142.txt", n, " ", A286142(n)));
(Scheme) (define (A286142 n) (* (/ 1 2) (+ (expt (+ (A257993 n) (A046523 n)) 2) (- (A257993 n)) (- (* 3 (A046523 n))) 2)))
(Python)
from sympy import factorint, prime, primepi, gcd
def T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
def P(n):
f = factorint(n)
return sorted([f[i] for i in f])
def a046523(n):
x=1
while True:
if P(n) == P(x): return x
else: x+=1
def a053669(n):
x=1
while True:
if gcd(prime(x), n) == 1: return prime(x)
else: x+=1
def a257993(n): return primepi(a053669(n))
def a(n): return T(a257993(n), a046523(n)) # Indranil Ghosh, May 05 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 04 2017
STATUS
approved