68862domain: NAppears in sequencesa(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is an oblong number.at n=38A214963Number of maximal matchings in the n-dipyramidal graph.at n=21A297064