A289628 Compound filter (for the structure of the multiplicative group of integers modulo n & prime signature of n): a(n) = P(A289626(n), A101296(n)), where P(n,k) is sequence A000027 used as a pairing function.

1, 2, 5, 8, 9, 12, 14, 41, 19, 18, 27, 50, 35, 25, 63, 99, 54, 40, 65, 86, 102, 42, 90, 203, 134, 52, 101, 131, 135, 128, 152, 342, 228, 75, 250, 221, 230, 88, 250, 399, 275, 182, 299, 271, 295, 117, 324, 517, 323, 185, 403, 295, 377, 146, 462, 623, 525, 168, 495, 549, 527, 187, 698, 728, 663, 343, 629, 460, 738, 370, 702, 889, 740, 273, 523, 590, 858, 370

Offset

1,2

Comments

Here, instead of A046523 and A289625 we use as the components of a(n) their rgs-versions A101296 and A289626 because of the latter sequence's more moderate growth rate.

For all i, j: a(i) = a(j) => A286160(i) = A286160(j).

For all i, j: a(i) = a(j) => A289622(i) = A289622(j).

Links

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

Formula

a(n) = (1/2)*(2 + ((A289626(n)+A101296(n))^2) - A289626(n) - 3*A101296(n)).

Prog

(Scheme) (define (A289628 n) (* (/ 1 2) (+ (expt (+ (A289626 n) (A101296 n)) 2) (- (A289626 n)) (- (* 3 (A101296 n))) 2)))

Crossrefs

Cf. A000027, A046523, A101296, A286160, A289622, A289626, A286454.

Sequence in context: A176061 A183234 A108968 * A047387 A063282 A276882

Adjacent sequences: A289625 A289626 A289627 * A289629 A289630 A289631

Keyword

nonn

Author

Antti Karttunen, Jul 19 2017

Status

approved