183696

Appears in sequences

• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles, including fixed points.at n=17A165115
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles of length greater than 1.at n=15A165117
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives least elements of each cycle, including fixed points.at n=7A165119
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives least elements of each cycle of length > 1.at n=5A165121
• 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.at n=13A165126
• Smallest member of cycle corresponding to n-th term of A165127.at n=7A165128
• Number of length n+5 0..7 arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=0A249232
• T(n,k)=Number of length n+5 0..k arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=21A249233
• Number of length 1+5 0..n arrays with no six consecutive terms having two times the sum of any two elements equal to the sum of the remaining four.at n=6A249234
• a(0) = 0, a(1) = 1. For n >= 2, a(n) = a(n-1)/(n-1) if n-1 divides a(n-1); otherwise, a(n) = a(n-1) + a(n-2).at n=49A343376