218960

Appears in sequences

• Consider the base-6 Kaprekar map n->K(n) defined in A165051. Sequence gives numbers belonging to cycles, including fixed points.at n=17A165056
• Consider the base-6 Kaprekar map n->K(n) defined in A165051. Sequence gives numbers belonging to cycles of length greater than 1.at n=11A165058
• Consider the base-6 Kaprekar map n->K(n) defined in A165051. Sequence gives least elements of each cycle, including fixed points.at n=9A165060
• Consider the base-6 Kaprekar map n->K(n) defined in A165051. Sequence gives least elements of each cycle of length > 1.at n=3A165062
• Smallest member of cycle corresponding to n-th term of A165068.at n=9A165069
• Triangle read by rows: T(n,k) is the number of labeled point-determining graphs with n nodes and k edges, n >= 0, 0 <= k <= n*(n - 1)/2.at n=51A369283