103041

Appears in sequences

• a(n) = (9*n + 6)^2.at n=35A017234
• a(n) = (10*n + 1)^2.at n=32A017282
• a(n) = (11*n + 2)^2.at n=29A017414
• a(n) = (12*n + 9)^2.at n=26A017630
• Smallest square containing n-th prime as substring.at n=26A029945
• Smallest extension of n-th prime which is a square.at n=26A030671
• Odd refactorable numbers.at n=34A036896
• List of pairs of consecutive refactorable numbers.at n=11A036898
• n is odd and divisible by number of divisors of n and sum of digits of n.at n=11A057530
• Square numbers not divisible by 10 whose reverse is pentagonal.at n=6A066742
• Triangle read by rows: T(n,k) is the coefficient of t^k (k>=1) in the polynomial P[n,t] defined by P[1,t]=t, P[2,t]=t^2, P[n,t]=tP[n-1,t]+t^2*P^2[n-2,1].at n=46A103524
• Triangle read by rows: T(n,k) is the coefficient of t^k (k>=1) in the polynomial P[n,t] defined by P[1,t]=t, P[2,t]=t^2, P[n,t]=tP[n-1,t]+t^2*P^2[n-2,1].at n=57A103524
• Triangle read by rows: T(n,k) is the coefficient of t^k (k>=1) in the polynomial P[n,t] defined by P[1,t]=t, P[2,t]=t^2, P[n,t]=tP[n-1,t]+t^2*P^2[n-2,1].at n=69A103524
• Powerful(1) numbers (A001694) whose digit reversal is a pentagonal number (A000326).at n=13A115695
• Squares for which the sum of the digits, the product of the digits, the digital root and the multiplicative digital root are all squares.at n=23A117680
• RF(3): refactorable numbers with smallest prime factor 3.at n=32A120319
• Squares whose decimal expansion contains no digit greater than 4.at n=29A158082
• Squares that become a prime number when prefixed with a 2.at n=17A167717
• Number of n X 3 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.at n=15A207118
• Number of 4Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=7A207731