A337609 -id:A337609 - cp's OEIS frontend

A337610 Positive integers m such that A126287^k(m) = m for some positive integer k.

1, 10, 15, 22, 26, 33, 34, 46, 51, 58, 65, 69, 70, 82, 86, 87, 94, 105, 106, 118, 122, 123, 130, 134, 141, 142, 146, 154, 159, 166, 177, 178, 190, 195, 202, 206, 213, 214, 215, 218, 226, 231, 238, 249, 250, 254, 262, 266, 267, 274, 285, 286, 298, 302, 303, 310

Offset: 1

Ely Golden, Oct 07 2020

A126287^k(m) means apply A126287 to m k times.
Equivalently, the numbers that belong to a cycle under the map x -> A126287(x).
For any term m in this sequence, A126287(A126287(m)) = m.
Supersequence of A017641. Moreover, this sequence (excluding the first term) can be represented as an infinite union of arithmetic progressions.
There are no primes in this sequence.

			10 is a term since A126287(A126287(10)) = A126287(15) = 10.

Ely Golden, Table of n, a(n) for n = 1..10000
Ely Golden, Python program for generating terms of this sequence

Cf. A017641, A126287, A337609, A337611, A337612.

A337611 Positive integers m such that A126288^k(m) = m for some positive integer k.

Original entry on oeis.org

2, 3, 6, 10, 14, 20, 22, 26, 28, 38, 44, 46, 52, 76, 78, 88, 94, 102, 105, 114, 116, 117, 136, 138, 152, 171, 186, 187, 195, 207, 212, 247, 248, 266, 282, 284, 285, 296, 304, 322, 333, 354, 366, 369, 387, 402, 403, 407, 414, 423, 425, 426, 430, 437, 442, 468

Offset: 1

Ely Golden, Sep 05 2020

nonn

A126288^k(m) means apply A126288 to m k times.
Equivalently, the numbers that belong to a cycle under the map x -> A126288(x).
2 and 3 are the only primes in this sequence.

			3 is a term since A126288(A126288(3)) = A126288(2) = 3.

Ely Golden, Table of n, a(n) for n = 1..7144
Ely Golden, Python program for (naïvely) generating terms of this sequence

Cf. A337609, A337610, A337612, A126288, A052126.

gpf(n) = vecmax(factor(n)[,1]);
f(n) = if (n==1, 2, n*gpf(n+1)/gpf(n)); \\ A126288
incycle(n, list) = {my(v=Vec(list)); #select(x->(x==n), v);}
cycle(n) = {my(list = List(), repeat=1); while(repeat, n = f(n); if (incycle(n, list), repeat=0); listput(list, n);); list;}
isok(n) = {my(list = cycle(n)); incycle(n, list);} \\ Michel Marcus, Sep 08 2020

For any term m, gcd {m, A126288(m), A126288(A126288(m)), ...} = A052126(m).

A337612 Positive integers m such that A126289^k(m) = m for some positive integer k.

Original entry on oeis.org

1, 6, 10, 15, 20, 21, 35, 38, 42, 45, 52, 58, 63, 66, 68, 74, 76, 77, 78, 84, 85, 88, 92, 99, 110, 116, 117, 124, 130, 133, 143, 146, 153, 164, 171, 187, 189, 198, 208, 224, 228, 232, 238, 246, 247, 255, 261, 266, 268, 272, 273, 279, 282, 284, 285, 304, 312

Offset: 1

Ely Golden, Oct 06 2020

nonn

A126289^k(m) means apply A126289 to m k times.
Equivalently, the numbers that belong to a cycle under the map x -> A126289(x).
There are no primes in this sequence.

			6 is a term since A126289(A126289(6)) = A126289(10) = 6.

Ely Golden, Table of n, a(n) for n = 1..10000
Ely Golden, Python program for (naïvely) generating terms of this sequence

Cf. A052126, A126289, A337609, A337610, A337611.

For any term m, gcd {m, A126289(m), A126289(A126289(m)), ...} = A052126(m).

cp's OEIS Frontend

A337610 Positive integers m such that A126287^k(m) = m for some positive integer k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A337611 Positive integers m such that A126288^k(m) = m for some positive integer k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A337612 Positive integers m such that A126289^k(m) = m for some positive integer k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula