168100

Appears in sequences

• a(n) = (11*n + 3)^2.at n=37A017426
• a(n) = (12*n + 2)^2.at n=34A017546
• Values square, differences triangular.at n=8A036449
• Squares which are the concatenation of two nonzero squares.at n=19A039686
• (Terms in A014738)/4.at n=19A051515
• Squares that are the sum of two consecutive primes.at n=26A062703
• a(1) = 0; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.at n=3A065689
• k^2 is a term if k^2 + (k-1)^2 and k^2 + (k+1)^2 are primes.at n=16A075577
• Squares which are concatenation of two positive squares with possible intervening zeros.at n=21A147608
• Numbers n such that phi(n)/n = 16/41.at n=28A176598
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=9A208067
• Perfect powers which are the sum of two consecutive primes.at n=32A245360
• Squares, without multiplicity, that are the concatenation of two integers (without leading zeros) the product of which is also a square.at n=20A258060
• Number of (n+2) X (2+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.at n=8A262268
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column divisible by 5, read as a binary number with top and left being the most significant bits.at n=46A262274