|
|
A226629
|
|
a(n) is the conjectured number of primitive cycles of positive integers under iteration by the Collatz-like 3x-k function, where k=A226630(n).
|
|
10
|
|
|
3, 1, 2, 1, 8, 1, 1, 1, 1, 3, 1, 1, 2, 1, 3, 1, 2, 5, 35, 2, 1, 2, 1, 6, 9, 136, 1, 1, 4, 2, 1, 1, 16, 3, 8, 8, 1, 9, 1, 2, 1, 16, 7, 9, 1, 1, 1, 26, 21, 13, 3, 4, 3, 2, 2, 38, 4, 2, 29, 3, 1, 1, 1, 1, 1, 5, 1, 3, 1, 1, 8, 8, 1, 34, 33, 3, 1, 3, 1, 1, 1, 96, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
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, where k is odd.
For primitive cycles, GCD(k,6)=1.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|