164025

Appears in sequences

• Squares of odd pentagonal pyramidal numbers.at n=2A014799
• a(n) = (11*n + 9)^2.at n=36A017498
• a(n) = (12*n + 9)^2.at n=33A017630
• Numbers of form 5^i*9^j, with i, j >= 0.at n=27A025624
• Squares such that digits of sqrt(n) appear in both n and n^(3/2).at n=28A029781
• Numbers whose prime factors are 3 and 5.at n=32A033849
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*9^j.at n=19A038251
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*5^j.at n=16A038295
• a(n) = Product_{d|n} (n/d + d).at n=25A045661
• Odd numbers divisible by exactly 10 primes (counted with multiplicity).at n=3A046323
• Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= n/3.at n=28A047195
• Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= (n-1)/3.at n=28A048007
• Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= (n-2)/3.at n=28A048018
• Numerator of Product_{2 <= p < 2*n} (2*n - p)/p.at n=22A084762
• RF(3): refactorable numbers with smallest prime factor 3.at n=37A120319
• a(n) = ((n+1)*(2*n-1))^2.at n=14A123198
• Numbers of the form p^8*q^2 where p and q are distinct primes.at n=9A179699
• Squares k such that gcd(sigma(k),usigma(k)) > 1, where usigma is A034448.at n=35A193003
• Number of (n+2) X 3 binary arrays avoiding patterns 001 and 011 in rows and columns.at n=13A202093
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=9A207730