57636domain: NAppears in sequencesa(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)=2.at n=22A067975G.f.: Product_{k>=1} (1 + x^k/k^2) = Sum_{n>=0} a(n)*x^n/n!^2.at n=6A326864