81510

Appears in sequences

• a(n) = n*(n+5)*(n+6)*(n+7)/24.at n=33A005587
• Exponential convolution of Fibonacci numbers with themselves.at n=11A014334
• a(n) = C(n)*(7*n + 1) where C(n) = Catalan numbers (A000108).at n=8A050477
• Expansion of (1+5*x)/(1-x)^10.at n=8A055848
• Products of exactly 6 distinct primes.at n=12A067885
• Numbers with six distinct prime divisors.at n=14A074969
• Smallest number beginning with 8 and having exactly n distinct prime divisors.at n=5A077333
• Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.at n=23A079095
• Ninth column (m=8) of (1,6)-Pascal triangle A096956.at n=9A097299
• Smallest number beginning with 8 that is the product of exactly n distinct primes.at n=5A106418
• a(n) = (n+1)*(n+2)^2*(n+3)*(7*n^2 + 23*n + 20)/240.at n=10A114240
• Records in A152235.at n=43A152452
• Numbers n such that sigma(n) = 14*phi(n) (where sigma=A000203, phi=A000010).at n=9A171259
• Values of the difference d for 6 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 5.at n=35A209205
• Values of the difference d for 7 primes in geometric-arithmetic progression with the minimal sequence {7*7^j + j*d}, j = 0 to 6.at n=8A209206
• Number of standard Young tableaux of shape [4n,4].at n=9A215544
• a(n) = binomial(10*n,n)*(8*n+1)/(9*n+1).at n=4A215554
• Numbers m such that 16*m*(3*m+1)+1 is a square.at n=5A217855
• Number of length 3+2 0..n arrays with the medians of every three consecutive terms nondecreasing.at n=9A250142
• z-value of the lexicographically first solution (x,y,z) of 4/n = 1/x + 1/y + 1/z with 0 < x < y < z all integers, or 0 if there is no such solution. Corresponding x and y values are in A257839 and A257840.at n=56A257841