A325827 a(n) = A325825(2*n, sigma(n)).

1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 4, 1, 4, 3, 1, 1, 3, 1, 1, 1, 4, 1, 3, 5, 1, 1, 28, 1, 3, 1, 1, 3, 1, 1, 4, 1, 1, 1, 10, 14, 12, 1, 4, 3, 1, 1, 4, 5, 1, 3, 5, 1, 12, 1, 4, 1, 1, 1, 12, 5, 4, 1, 1, 1, 48, 1, 1, 3, 16, 1, 3, 5, 1, 5, 4, 1, 12, 1, 1, 1, 14, 1, 28, 1, 1, 3, 1, 1, 9, 16, 1, 5, 1, 1, 12, 5, 11, 3, 1, 34, 12, 1, 5, 3

Offset: 1

Author

Antti Karttunen, May 22 2019

Keywords

• nonn

Comments

See also comment in A325808.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..20000

Crossrefs

Cf. A000203, A325808, A325825.

Cf. also A325635, A325636.

Programs

PARI

A004488(n) = subst(Pol(apply(x->(3-x)%3, digits(n, 3)), 'x), 'x, 3);
A325825sq(a,b) = { my(a=fromdigits(Vec(lift(gcd(Pol(digits(a,3))*Mod(1, 3),Pol(digits(b,3))*Mod(1, 3)))),3), b=A004488(a)); min(a,b); };
A325827(n) = A325825sq(n+n, sigma(n));

Formula

a(n) = A325825(2*n, A000203(n)).

Extensions

Terms corrected to agree with the new corrected definition of A325825. - Antti Karttunen, Jan 11 2020