A364497 - OEIS

A364497

Numbers k such that k divides A243071(k).

1, 3, 6, 12, 24, 43, 48, 86, 96, 172, 192, 344, 384, 688, 768, 1177, 1376, 1536, 2354, 2752, 3072, 3503, 4708, 5504, 6144, 7006, 9416, 11008, 12288, 14012, 18832, 22016, 24576, 28024, 37664, 44032, 49152, 49477, 56048, 75328, 88064, 98304, 98954, 112096, 150656, 169413, 176128, 196608, 197908, 224192, 301312, 338826

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

If n is present, then 2*n is also present, and vice versa.

A007283 is included as a subsequence, because it gives the known fixed points of map n -> A163511(n).

Sequence A163511(A364496(.)) sorted into ascending order.

LINKS

Table of n, a(n) for n=1..52.

Index entries for sequences computed from indices in prime factorization

PROG

(PARI)

A054429(n) = ((3<<#binary(n\2))-n-1); \\ From A054429

A156552(n) = { my(f = factor(n), p, p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res };

A243071(n) = if(n<=2, n-1, A054429(A156552(n)));

isA364497(n) = !(A243071(n)%n);

CROSSREFS

Cf. A163511, A243071.

Cf. A007283 (subsequence), A364498 (odd terms).

Cf. also A364295, A364494, A364496.

Sequence in context: A079079 A283839 A336758 * A132974 A132979 A163314

Adjacent sequences: A364494 A364495 A364496 * A364498 A364499 A364500

KEYWORD

nonn

AUTHOR

Antti Karttunen, Jul 27 2023

STATUS

approved