6718464

Appears in sequences

• Convolution of A049612 with A011782.at n=15A055589
• Card-matching numbers (Dinner-Diner matching numbers).at n=29A059059
• Card-matching numbers (Dinner-Diner matching numbers).at n=22A059069
• For an integer n with prime factorization p_1*p_2*p_3* ... *p_m let n* = (p_1+1)*(p_2+1)*(p_3+1)* ... *(p_m+1); sequence gives n* such that n* is divisible by n, ordered by increasing value of n.at n=19A064518
• Third column of triangle A067410 and second column of A067417.at n=9A067411
• a(n) = (5*6^n+(-6)^n)/6.at n=9A083223
• For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3.at n=35A084391
• Numerator of n*B(n,1+1/n), where B(.,.) is the Beta Function.at n=5A145921
• Integers n such that if you insert between each of their digits either "*" (times), "^" (exponentiation), or "nothing" (so that two or more digits are merged to form an integer), then you can recover n in a nontrivial way (however, two "^" mustn't be adjacent - you must avoid decompositions containing a^b^c).at n=17A156322
• a(n) = 6*a(n-2) for n > 2; a(1) = 1, a(2) = 4.at n=17A164532
• a(n) = 6*a(n-2) for n > 2; a(1) = 4, a(2) = 1.at n=16A166027
• Hankel transform of A168503.at n=5A168504
• Consider the list s(1), s(2), ... of numbers that are products of exactly n primes; a(n) is the smallest s(j) whose decimal expansion ends in j.at n=18A186000
• Number of (n+1)X8 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that b(i,j)*b(i-1,j)-c(i,j)*c(i,j-1) is nonzero.at n=1A204105
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) such that b(i,j)*b(i-1,j)-c(i,j)*c(i,j-1) is nonzero.at n=29A204106
• a(0) = 3; a(n+1) is the smallest number not in the sequence such that a(n+1) - Sum_{i=0..n} a(i) divides a(n+1) + Sum_{i=0..n} a(i).at n=42A250306
• a(n) = product of first k composites, with the i-th composite raised to the d-th power, where k = A055642(n) and d is the i-th digit of n.at n=17A270142
• Number of permutations p of [n] such that p(i)-i is a multiple of eight for all i in [n].at n=25A275063
• Number of permutations p of [n] such that p(i)-i is a multiple of ten for all i in [n].at n=28A275065
• Records in A319100.at n=31A307252