50421

Appears in sequences

• Numbers of the form 3^i*7^j with i, j >= 0.at n=35A003594
• a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=a(2)=1 and a(3)=3.at n=17A024947
• Numbers whose prime factors are 3 and 7.at n=20A033850
• Numbers n such that n | 8^n + 7^n + 6^n.at n=44A057233
• Largest k such that n*k has n divisors, or 0 if there are no possibilities for k or infinitely many.at n=20A076932
• Integers k for which {prime(1), prime(2), ..., prime(k)} (mod 4) is biased towards 1.at n=21A096628
• Maximum number of spanning trees in a cubic graph on 2n vertices.at n=5A108941
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+16807)^2 = y^2.at n=11A118576
• a(n) is the n-th positive integer which is divisible by the same distinct primes as n and which is divisible by no other primes.at n=20A119361
• A triangular sequence from the Z/nZ matrix addition tables as in sequence A095897 as coefficients of characteristic polynomials: M(n,m)=Mod[n + m, d] for n <=m<=d.at n=30A138064
• a(n) = ((n-th prime)^6-(n-th prime)^5)/2.at n=3A138460
• Triangle read by rows: characteristic polynomials of Z/nZ addition tables considered as matrices.at n=34A140059
• Number of rooted trees with n points and exactly k specified colors: C(n,k), 1<=n, 1<=k<=n.at n=23A141610
• a(n) = 3*7^n.at n=5A169634
• Partial sums of A048890.at n=22A172973
• Triangle by rows T(n,k), showing the number of meanders with length (n+1)*3 and containing (k+1)*3 L's and (n-k)*3 R's, where L's and R's denote arcs of equal length and a central angle of 120 degrees which are positively or negatively oriented.at n=30A194595
• Number of n X 6 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=1A222442
• T(n,k) = number of n X k 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=22A222444
• T(n,k) = number of n X k 0..3 arrays with entries increasing mod 4 by 0, 1 or 2 rightwards and downwards, starting with upper left zero.at n=26A222444
• T(n,k)=Number of nXk 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, and top left element zero.at n=26A232955