A267435 - cp's OEIS frontend

A267435 Numbers n such that each reduced Collatz trajectory (mod p): (n, T(n), T(T(n)),..., 4, 2, 1) / pZ, where the odd prime p is the number of iterations needed to reach 1, contains exactly the p-1 values {1, 2, 3, .., p-1}.

n	a(n)
1	8
2	20
3	32
4	320
5	2048
6	2216
7	8192
8	13312
9	87040
10	218432
11	524288
12	89478400
13	536870912
14	137438953472
15	250199979283796
16	9007199254740992
17	63800994005254144
18	96076791692656640
19	382805968326492160
20	576460752303423488
21	2305843009213693952
22	4099276399740365440

[8, 20, 32, 320, 2048, 2216, 8192, 13312, 87040, 218432, 524288, 89478400, 536870912, 137438953472, 250199979283796, 9007199254740992, 63800994005254144, 96076791692656640, 382805968326492160, 576460752303423488, 2305843009213693952, 4099276399740365440]

cp's OEIS Frontend

A267435 Numbers n such that each reduced Collatz trajectory (mod p): (n, T(n), T(T(n)),..., 4, 2, 1) / pZ, where the odd prime p is the number of iterations needed to reach 1, contains exactly the p-1 values {1, 2, 3, .., p-1}.

Table of values

List of values