A151959
Consider the Kaprekar map x->K(x) described in A151949. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
0, 53955, 64308654, 61974, 86420987532
Offset: 1
a(1) = 0: 0 -> 0.
a(2) = 53955: 53955 -> 59994 -> 53955 -> ...
a(3) = 64308654: 64308654 -> 83208762 -> 86526432 -> 64308654 -> ...
a(4) = 61974: 61974 -> 82962 -> 75933 -> 63954 -> 61974 -> ...
A099009 gives the fixed points and
A099010 gives numbers in cycles of length > 1.
The term a(3) = 64308654 was initially only a conjecture, but was confirmed by
Zak Seidov, Aug 19 2009
a(4) = 61974 corrected by
R. J. Mathar, Aug 19 2009 (we had not given the smallest member of the 4-cycle).
a(4) = 61974, a(7) = 420876, and a(8) = 7509843 confirmed by
Zak Seidov, Aug 19 2009 (formerly the a(8) value was just an upper bound)
a(5) = 86420987532 and a(14) = 753098643 from
Joseph Myers, Aug 19 2009. He also confirms the other values, and remarks that there are no other cycle lengths up to at least 140 digits.
A165047
Consider the base-5 Kaprekar map x->K(x) described in A165032. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
0, 48, 45781056, 1992, 7488, 249992, 26648194761946797370910644531056, 170312312, 447082519531056, 953674316406249992, 43487548828124832, 68219378590583801269531056
Offset: 1
A165126
Consider the base-9 Kaprekar map x->K(x) described in A165110. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
0, 16, 2256, 31596672, 34960, 26531651360, 14560721001508880, 8724454714749973651840, 108401672318914272, 711223428647787942432, 16513410921312, 278474880, 4754966263206652084045296, 183696
Offset: 1
A165008
Consider the base-3 Kaprekar map x->K(x) described in A164993. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
0, 32, 320, 26240, 1240024, 11160256, 2297798771761759543384, 15075857741528904364175224, 8135830264, 5931020266096, 659002251784, 350220815692997944
Offset: 1
A165028
Consider the base-4 Kaprekar map x->K(x) described in A165012. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
A165067
Consider the base-6 Kaprekar map x->K(x) described in A165051. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
A165106
Consider the base-8 Kaprekar map x->K(x) described in A165090. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n.
Original entry on oeis.org
0, 17892, 1589, 21483, 1022, 7034104602, 1445787
Offset: 1
Showing 1-7 of 7 results.
Comments