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-2 of 2 results.

A226673 Conjectured record-breaking numbers of odd elements, for ascending positive integers k, in primitive cycles of positive integers under iteration by the Collatz-like 3x+k function.

Original entry on oeis.org

1, 17, 18, 26, 41, 56, 74, 80, 89, 115, 126, 142, 215, 220, 256, 311, 387, 1000, 1136, 1146, 2253, 2292, 2590, 2937, 4971, 5326, 7157, 8294, 9920, 18862, 20429, 24842, 31913
Offset: 1

Views

Author

Geoffrey H. Morley, Jun 19 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 = A226674(n). The smallest integer in the T_k cycle associated with a(n) is A226675(n).
Cf. A226610, A226689.

A226674 Integer k associated with the conjectured record-breaking number A226673(n) of odd elements in a primitive Collatz-like 3x+k cycle.

Original entry on oeis.org

1, 5, 17, 23, 29, 85, 125, 143, 253, 313, 439, 509, 563, 1079, 1135, 1307, 1699, 3299, 8431, 10531, 11491, 16819, 22097, 24917, 49787, 67475, 76733, 99391, 110273, 111611, 144379, 273641, 308219
Offset: 1

Views

Author

Geoffrey H. Morley, Jun 19 2013

Keywords

Crossrefs

Cf. A226675.
Showing 1-2 of 2 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.