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

Search: id:a286612
Showing 1-1 of 1

%I A286612 #10 Jun 20 2017 23:11:35
%S A286612 65,513,1026,4107,8200,8256,16400,16450,16512,16544,16641,32800,32900,
%T A286612 33024,33282,33920,49184,65600,65800,66048,66080,131200,131334,132096,
%U A286612 132160,163968,262400,262668,264192,264320,274432,327936,524342,524610,524800,524832,525826,528384,532500,540736,548864,655872,786467,1048617
%N A286612 Numbers n for which A019565(n) <= A087207(n) < n.
%C A286612 Any 2-cycle of A087207 and also any 2-cycle of A019565 (in which case A019565(x) = A087207(x) for both members of the cycle), if such cycles exist at all, must have the larger one of its members included in this sequence.
%H A286612 Antti Karttunen, <a href="/A286612/b286612.txt">Table of n, a(n) for n = 1..97</a>
%H A286612 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A286612 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%o A286612 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o A286612 (define A286612 (MATCHING-POS 1 1 (lambda (n) (and (< (A087207 n) n) (<= (A019565 n) (A087207 n))))))
%Y A286612 Intersection of A286608 and A286611.
%Y A286612 Subsequence of A285315.
%Y A286612 Cf. A019565, A087207, A285319, A286609.
%K A286612 nonn,base
%O A286612 1,1
%A A286612 _Antti Karttunen_, Jun 20 2017

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