OFFSET
1,2
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Pairing Function
PROG
(PARI)
A051064(n) = if(n<1, 0, 1+valuation(n, 3));
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
for(n=1, 10000, write("b286463.txt", n, " ", A286463(n)));
(Scheme) (define (A286463 n) (* (/ 1 2) (+ (expt (+ (A051064 n) (A046523 n)) 2) (- (A051064 n)) (- (* 3 (A046523 n))) 2)))
(Python)
from sympy import factorint, divisors, divisor_count, mobius
def a051064(n): return -sum([mobius(3*d)*divisor_count(n/d) for d in divisors(n)])
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 T(n, m): return ((n + m)**2 - n - 3*m + 2)/2
def a(n): return T(a051064(n), a046523(n)) # Indranil Ghosh, May 11 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 10 2017
STATUS
approved