97944

Appears in sequences

• a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=1.at n=37A014563
• Integers that are Rhonda numbers to base 9.at n=14A100973
• Coefficients of mock modular form H_1^(4) (divided by 2).at n=20A256051
• Fourier coefficients of the modular form (1/t_{3A}^2) * F_{3A}^12.at n=17A341558