A286453 Compound filter: a(n) = P(A061395(n), A286465(n)), where P(n,k) is sequence A000027 used as a pairing function.

0, 2, 5, 11, 94, 5, 14, 254, 17, 9, 195, 47, 259, 500, 9, 11, 413, 138, 44, 303, 32, 20, 2784, 47, 354, 216, 5, 329, 506, 9, 77, 3161, 356, 35, 175, 107, 202, 2709, 216, 24, 11188, 14, 420, 356, 24, 285, 450, 498, 70, 2349, 35, 51, 115937, 5, 20, 329, 74, 310, 3420, 864, 1243, 336, 500, 11, 384, 20, 580, 47285, 87, 14, 615, 498, 1296, 3015, 9, 74, 3491, 216

Offset

1,2

Links

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

Indranil Ghosh, Python program to generate the sequence

Formula

a(n) = (1/2)*(2 + ((A061395(n)+A286465(n))^2) - A061395(n) - 3*A286465(n)).

Prog

(Scheme) (define (A286453 n) (* (/ 1 2) (+ (expt (+ (A061395 n) (A286465 n)) 2) (- (A061395 n)) (- (* 3 (A286465 n))) 2)))

Crossrefs

Cf. A000027, A046523, A061395, A112049, A278223, A286356, A286372, A286452.

Sequence in context: A362351 A213073 A267527 * A309375 A018847 A178318

Adjacent sequences: A286450 A286451 A286452 * A286454 A286455 A286456

Keyword

nonn

Author

Antti Karttunen, May 14 2017

Status

approved