19752

Appears in sequences

• a(n) = 1*t(n) + 2*t(n-1) + ...+ k*t(n+1-k), where k=floor((n+1)/2) and t is A001950 (upper Wythoff sequence).at n=43A023867
• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=42A024864
• Number of proper factorizations of p1^n*p2^2, where p1 and p2 are distinct primes.at n=23A031125
• Number of binary [ n,3 ] codes.at n=23A034357
• Numbers n such that 299*2^n-1 is prime.at n=13A050908
• Nearest integer to log(n^n)^(1 + log(log(1 + n))).at n=26A062480
• Starting positions of strings of three 8's in the decimal expansion of Pi.at n=15A083637
• Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=8A207046
• Numbers n such that 2*Fibonacci(n+2)+((-1)^n-3)/2 is a prime.at n=34A271729
• Number of simple moves of the smallest disk in the solution to the Towers of Hanoi exchanging disks puzzle with 3 pegs and n disks.at n=17A341582
• Number T(n,k) of sets of n words of length n over binary alphabet where the first letter occurs k times; triangle T(n,k), n>=0, n-signum(n)<=k<=n*(n-1)+signum(n), read by rows.at n=29A360693
• Number T(n,k) of sets of n words of length n over binary alphabet where the first letter occurs k times; triangle T(n,k), n>=0, n-signum(n)<=k<=n*(n-1)+signum(n), read by rows.at n=34A360693