420876

Appears in sequences

• a(n) = n^2*(n^2+3)/4.at n=35A039623
• Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives numbers belonging to cycles of length greater than 1.at n=10A099010
• Iterate the Kaprekar map of A151949 starting at the n-digit number 100...02; sequence gives the lowest number in the resulting cycle.at n=4A151957
• Smallest member of cycle corresponding to n-th term of A151964.at n=6A151965
• Iterate the Kaprekar map of A151949 starting at the n-digit number 100...01; sequence gives the lowest number in the resulting cycle.at n=4A151967
• Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives numbers belonging to cycles, including fixed points.at n=13A164716
• Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives least elements of each cycle, including fixed points.at n=6A164718
• Consider the Kaprekar map n->K(n) defined in A151949. Sequence gives least elements of each cycle of length > 1.at n=3A164720
• Numbers belonging to cycles of length 7 under the Kaprekar map A151949.at n=0A164729
• Least element of each cycle of length 7 under the Kaprekar map A151949.at n=0A164730
• Triangle read by rows: T(n,m) is the number of pattern classes in the (n,m)-rectangular grid with 6 colors and n>=m, two patterns are in the same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=12A286893