A332823 A 3-way classification indicator generated by the products of two consecutive primes and the cubes of primes. a(n) is -1, 0, or 1 such that a(n) == A048675(n) (mod 3).
0, 1, -1, -1, 1, 0, -1, 0, 1, -1, 1, 1, -1, 0, 0, 1, 1, -1, -1, 0, 1, -1, 1, -1, -1, 0, 0, 1, -1, 1, 1, -1, 0, -1, 0, 0, -1, 0, 1, 1, 1, -1, -1, 0, -1, -1, 1, 0, 1, 0, 0, 1, -1, 1, -1, -1, 1, 0, 1, -1, -1, -1, 0, 0, 0, 1, 1, 0, 0, 1, -1, 1, 1, 0, 1, 1, 0, -1, -1, -1, -1, -1, 1, 0, -1, 0, 1, 1, -1, 0
Offset: 1
Keywords
Links
Crossrefs
Cf. A353354 (inverse Möbius transform, gives another 3-way classification indicator function).
Cf. A332820, A332821, A332822 for positions of 0's, 1's and -1's in this sequence; also A003159, A036554 for the modulo 2 equivalents.
Programs
-
PARI
A332823(n) = { my(f = factor(n),u=(sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3); if(2==u,-1,u); };
Formula
For all n >= 1, k >= 1: (Start)
a(n * k) == a(n) + a(k) (mod 3).
a(A331590(n,k)) == a(n) + a(k) (mod 3).
a(n^2) = -a(n).
a(A003961(n)) = -a(n).
a(A297845(n,k)) = a(n) * a(k).
(End)
For all n >= 1: (Start)
a(A000040(n)) = (-1)^(n-1).
a(A225546(n)) = a(n).
a(A097248(n)) = a(n).
(End)
a(n) = A332814(A332462(n)). [Compare to the formula above. For a proof, see A353350.] - Antti Karttunen, Apr 16 2022
Comments