91212

Appears in sequences

• Number of semi-regular digraphs (with loops) on n unlabeled nodes with each node having out-degree 3.at n=3A005535
• Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives numbers belonging to cycles, including fixed points.at n=15A165076
• Consider the base-7 Kaprekar map n->K(n) defined in A165071. Sequence gives numbers belonging to cycles of length greater than 1.at n=14A165078
• Number of length n+3 0..6 arrays with no pair in any consecutive four terms totaling exactly 6.at n=3A246477
• T(n,k)=Number of length n+3 0..k arrays with no pair in any consecutive four terms totalling exactly k.at n=39A246479
• Number of length 4+3 0..n arrays with no pair in any consecutive four terms totalling exactly n.at n=5A246483
• Triangle read by rows: T(n,k) is the number of semi-regular relations on n nodes with each node having out-degree k (0 <= k <= n).at n=24A259471