Base 190: Cycles Sequences: Maximum Length Cycle Count

Blog: The First Pixel: Kaprekar's Constant 6174

Radix Character Encoding
0123456789ABCDEF
GHIJKLMNOPQRSTUV
WXYZabcdefghijkl
mnopqrstuvwxyzΑΒ
ΓΔΕΖΗΘΙΚΛΜΝΞΟΠΡΣ
ΤΥΦΧΨΩαβγδεζηθικ
λμνξοπρςστυφχψωА
БВГДЕЖЗИЙКЛМНОПР
СТУФХЦЧШЩЪЫЬЭЮЯа
бвгдежзийклмнопр
стуфхцчшщъыьэюя

Color Key
OrangeFixed Pointnumber that becomes itself after one iteration
GreenFinal Numbersall numbers eventually reached, from all cycles
PurpleCycle Startiterations include entry into cycle, assuming it repeats
RedFull Cycleiterations include entire cycle, proving it repeats
BlueStart Numberssubset (optimization) of all numbers; minimal for full coverage
GrayNo Resultsany calculation that has no results

Digits # Full Cycles
(excluding zero)
Max Cycle
Length
Longest Full Cycles
(excluding zero)
(bold = exactly one cycle [excluding zero])
10 cycles--
21 cycle 95 nodes0ク → ギ1 → ガ3 → エ7 → яF → пV → ПΒ → ΑР → ΓО → yТ → ΗК → qЪ → Ψτ → Kъ → еf → υΧ → Mш → бj → νζ → 6ォ → アD → уR → Чt → ΡА → Wо → НΔ → wФ → ΛЖ → iв → οδ → Aゥ → щL → гh → ρβ → Eァ → сT → Уx → ΙИ → mЮ → ημ → 4カ → ウ9 → ыJ → зd → ωΣ → Uр → Сz → ΕМ → uЦ → ΟВ → aк → ЕΜ → gд → σΩ → Iь → йb → ГΞ → cи → БΠ → Yм → ЙΘ → oЬ → γπ → Cィ → хP → Ыp → ας → Gю → нX → ЛΖ → sШ → Τψ → Sт → Хv → ΝД → eж → χΥ → Qф → Щr → Φφ → Oц → Эn → εξ → 8ェ → эH → лZ → ЗΚ → kа → λθ → 2キ → オ5 → イB → чN → Яl → ικ
31 cycle (fixed) 1 node ιクκ
435 cycles36 nodesM1キщ → ガвh4 → エπβ8 → яDァG → уоVS → ЧОΒu → ΡzРБ → ΕXмН → ЛvФΗ → ΝrШЕ → Φfдχ → υPфΨ → ЫLшq → гΩςi → ρHьγ → лDァa → уЖΚS → Чjаu → νΠАη → Y5ォн → イКΖC → чrШO → ЯΥφm → ιPфλ → Ы1キq → ガΩς4 → エHь8 → якZG → пЖΚW → ПjаΓ → νzРη → Ε5ォН → イvФC → чΜДO → Яfдm → υθκΨ
53 cycles4 nodesПΑクПΓ → РzクРΒ → СΒクОΑ → РΓクНΒ