35520

Appears in sequences

• a(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=25A023097
• Number of inequivalent connected planar figures that can be formed from n non-overlapping 1 X 2 rectangles (or dominoes).at n=6A056786
• Fixed points of iteration in A077091.at n=5A077092
• Expansion of Product_{k > 0} (1 + f(k)*x^k), where f(k) = A147952(A004001(k)).at n=41A147982
• Numbers with prime factorization pqrs^6.at n=16A190292
• Sum of all the n-digit numbers whose digits are all even and nonzero: 2,4,6,8.at n=2A192370
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, five or six distinct values for every i,j,k<=n.at n=5A211735
• Row sums of A124576.at n=7A227081
• Number of partitions p of n such that (maximal multiplicity of the parts of p) < (maximal part of p).at n=41A240310
• Numbers equidistant from twin prime pairs that are also equidistant from numbers equidistant from twin prime pairs.at n=33A260517
• Number of 6-cycles in the n X n rook graph.at n=5A288960
• Numbers k for which sigma(k) >= 2*k and (sigma(k) - 2*k) AND k = k, where AND is bitwise-and, A004198.at n=28A388026
• Square array A(n,k) = A326128(A388981(n, k)), read by descending antidiagonals.at n=65A388988