# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a286593
Showing 1-1 of 1

%I A286593 #7 May 21 2017 23:59:27
%S A286593 1,1,5,1,4,12,24,1,16,2,30,38,37,13,32,1,46,56,80,79,22,107,139,138,
%T A286593 137,22,173,18,172,175,281,1,67,154,122,211,232,57,139,254,277,121,
%U A286593 327,8,37,381,439,408,407,436,212,11,466,138,564,598,562,596,668,784,704,258,196,1,352,121,782,22,301,38,864,821,862,562,632,47,631,156,1039,947,407
%N A286593 Compound filter (the length of rightmost run of 1's in base-2 & deficiency/abundance): a(n) = P(A089309(n), A286449(n)), where P(n,k) is sequence A000027 used as a pairing function.
%H A286593 Antti Karttunen, <a href="/A286593/b286593.txt">Table of n, a(n) for n = 1..10000</a>
%H A286593 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PairingFunction.html">Pairing Function</a>
%F A286593 a(n) = (1/2)*(2 + ((A089309(n)+A286449(n))^2) - A089309(n) - 3*A286449(n)).
%o A286593 (Scheme) (define (A286593 n) (* (/ 1 2) (+ (expt (+ (A089309 n) (A286449 n)) 2) (- (A089309 n)) (- (* 3 (A286449 n))) 2)))
%Y A286593 Cf. A000027, A033879, A033880, A089309, A286449, A286592, A286595.
%K A286593 nonn
%O A286593 1,3
%A A286593 _Antti Karttunen_, May 21 2017

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE