cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A226667 Conjectured record-breaking values, for ascending positive integers k, of the maximal element of the primitive cycles of positive integers under iteration by the Collatz-like 3x+k function.

Original entry on oeis.org

1, 3397, 2277097, 106035623, 128946539, 153247321, 885327131, 6372904817, 52894692341, 95712964765, 301829916841, 1846456176103, 2697688935023, 10281192195005, 10556691785131, 13239192635131
Offset: 1

Views

Author

Geoffrey H. Morley, Jun 15 2013

Keywords

Comments

A cycle is called primitive if its elements are not a common multiple of the elements of another cycle.
The 3x+k function T_k is defined by T_k(x) = x/2 if x is even, (3x+k)/2 if x is odd.
For primitive cycles, GCD(k,6)=1.

Crossrefs

k = A226668(n). The smallest integer in the T_k cycle associated with a(n) is A226669(n).
Cf. A226608, A226683.

A226669 Smallest integer in the primitive Collatz-like 3x+k cycle with the conjectured record-breaking maximal element A226667(n).

Original entry on oeis.org

1, 347, 3811, 177337, 4513, 17, 174121, 461, 799, 11, 14212775, 133, 1531, 47, 56993425, 587
Offset: 1

Views

Author

Geoffrey H. Morley, Jun 15 2013

Keywords

Crossrefs

k = A226668(n).
Cf. A226685.

A226684 Integer k associated with the conjectured record-breaking maximal element A226683(n) of primitive 3x-k cycles.

Original entry on oeis.org

1, 17, 19, 23, 121, 131, 311, 313, 467, 5137, 56413, 66781, 143369
Offset: 1

Views

Author

Geoffrey H. Morley, Jun 15 2013

Keywords

Crossrefs

Cf. A226668, A226685.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.