19144

Appears in sequences

• Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=28A034587
• Numbers k which are (sum of digits of k) concatenated with (product of digits of k).at n=13A062237
• A B3-sequence: a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the sums of any three terms are all distinct.at n=22A096772
• List of fixed points of the base-3 Kaprekar map A164993.at n=4A164997
• Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives numbers belonging to cycles, including fixed points.at n=16A164998
• Consider the base-3 Kaprekar map n->K(n) defined in A164993. Sequence gives least elements of each cycle, including fixed points.at n=9A165002
• Smallest member of cycle corresponding to n-th term of A165009.at n=9A165010
• Number of 3-step knight's tours on an (n+2) X (n+2) board summed over all starting positions.at n=18A186852
• Number of 4-step king's tours on an n X n board summed over all starting positions.at n=8A186863
• Number of squares of all sizes in polyominoes obtained by union of two pyramidal figures (A092498) with intersection equals A002623.at n=37A260918
• Number of n-step closed paths on the Cairo pentagonal lattice graph starting from a degree-4 node.at n=11A357810