A286612 Numbers n for which A019565(n) <= A087207(n) < n.

65, 513, 1026, 4107, 8200, 8256, 16400, 16450, 16512, 16544, 16641, 32800, 32900, 33024, 33282, 33920, 49184, 65600, 65800, 66048, 66080, 131200, 131334, 132096, 132160, 163968, 262400, 262668, 264192, 264320, 274432, 327936, 524342, 524610, 524800, 524832, 525826, 528384, 532500, 540736, 548864, 655872, 786467, 1048617

Offset

1,1

Comments

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.

Links

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

Index entries for sequences related to binary expansion of n

Index entries for sequences computed from indices in prime factorization

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A286612 (MATCHING-POS 1 1 (lambda (n) (and (< (A087207 n) n) (<= (A019565 n) (A087207 n))))))

Crossrefs

Intersection of A286608 and A286611.

Subsequence of A285315.

Cf. A019565, A087207, A285319, A286609.

Sequence in context: A251158 A251151 A222588 * A276963 A338413 A211404

Adjacent sequences: A286609 A286610 A286611 * A286613 A286614 A286615

Keyword

nonn,base

Author

Antti Karttunen, Jun 20 2017

Status

approved