51712

Appears in sequences

• Greatest number in row n of array T given by A027157.at n=12A027168
• Binomial transform of A073145: a(n)=Sum(binomial(n,k)*A073145(k),(k=0,..,n)).at n=25A075115
• Binomial transform of A084265.at n=11A084266
• Numbers in A086473 corresponding to the unique product of two numbers having the unique sum of A086533.at n=19A086860
• a(2n+2) = 9*a(2n+1), a(2n+1) = 9*a(2n) - 8^n*A000108(n), a(0)=1.at n=5A156566
• Numbers of the form p^9*q where p and q are distinct primes.at n=25A179692
• Let L = A185064(n) be the n-th length for which a Golay sequence exists; a(n) = number of non-constructable Golay sequences of length L.at n=11A208926
• Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.at n=17A263534
• Indices of primes in A266891.at n=30A304210
• Array read by antidiagonals: T(n,m) is the number of acyclic edge sets in the complete bipartite graph K_{n,m}.at n=48A328887
• Array read by antidiagonals: T(n,m) is the number of acyclic edge sets in the complete bipartite graph K_{n,m}.at n=51A328887