176820

Appears in sequences

• a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).at n=37A023095
• Numbers n such that sigma(reverse(n)) = phi(n).at n=31A070856
• Largest x such that 1/x + 1/y + 1/z = 1/n.at n=19A082986
• Integer squares y from the smallest solutions of y^2 = x*(a^N - x)*(b^N + x) (elliptic line, Weierstrass equation) with a and b legs in primitive Pythagorean triangles and N = 2. Sequence ordered in increasing values of leg a.at n=26A120210
• a(n) = (p+2)!/p! where p is the n-th lesser twin prime, A001359(n).at n=21A126251
• a(n) = floor(n^4/4).at n=29A131479
• a(1) = 1, a(2*n) = a(n)^2, a(2*n+1) = a(n)*(a(n)+1).at n=54A139145
• a(n) = n*(n+1)*(n*(n+1)+1).at n=21A169938
• a(n) = n^4 + 6n^3 + 14n^2 + 15n + 6.at n=19A176780
• Sum of positive even numbers up to n^2.at n=28A235367
• Irregular table read by rows: T(0,0) = 2 and T(n,2k) = T(n-1,k)+1, T(n,2k+1) = T(n-1,k)*(T(n-1,k)+1) for 0 <= k < 2^(n-1).at n=38A273317
• Alternate version of A273317 with rows sorted in ascending order.at n=56A273338
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is defined by the following: A(1,k) = k and A(n,k) = A(n-1,k)*(A(n-1,k)+1) for n > 1.at n=24A298484
• Oblong composite numbers m such that beta(m) = tau(m)/2 - 1 where beta(m) is the number of Brazilian representations of m and tau(m) is the number of divisors of m.at n=23A326384