[seqfan] Exploiting A320486

[Lars Blomberg]

Hello Seqfans,

 

Consider the map k -> A320486(n*k) for n>=2.

For any start value, the iteration will end in 1) empty 2) a fixed point 3)
a cycle.

Use all the 8877690 start values with no digit duplications. 

Of these, the count that ends in empty is 

635049, 3619608, 1102688, 556961, 891099, 766847, 8685303, 8690281, 0,
8556958, .

The # of different cycles is

3, 3, 3, 2, 5, 6, 1, 15, 986409, 4, 8, 5, 1, 0, 2, .

The length of the longest cycle is

28, 23, 14, 22, 12, 45, 8, 4, 2, 9, 5, 17, 52, -1, 11, .

Etc.

One may also use the maps k -> A320486(n+k), k -> A320486(k^n), k ->
A320486(Polygonal(n,k)) where n is the rank.

Is this interesting?

 

Best regards,

Lars B