47104

Appears in sequences

• Expansion of g.f. (1+2*x)/(1-2*x)^2.at n=11A014480
• a(n) = 2^n*(binomial(n,2) + 1).at n=10A052481
• Numbers k of the form k=p*2^x, with p prime and x>=0, such that tau(k)-m = A058933(k) where tau(k) is the number of divisors of k and m is 0 or 1.at n=8A058953
• Number of labeled rooted trees with all 2n nodes of odd degree.at n=3A060279
• 12-almost primes (generalization of semiprimes).at n=23A069273
• Floor[ concatenation of n+2, n+1 and n divided by 3 ].at n=12A075004
• a(n) = A080301(A080293(n)).at n=3A080296
• Inverse binomial transform of n*Pell(n).at n=23A093968
• Number of Pythagorean quintuples mod n; i.e., number of solutions to v^2 + w^2 + x^2 + y^2 = z^2 mod n.at n=15A096020
• Number of 3 X 3 symmetric matrices over Z(n) having determinant 0.at n=7A115223
• An Euler triangle.at n=24A117414
• a(n) = n*2^(floor(n/2)).at n=23A132344
• Binomial transform of [1, 2, -3, -4, 5, 6, -7, -8, 9, 10, ...].at n=23A140230
• Hankel transform of A186039.at n=11A186040
• Maximum number of tatami tilings of any m X m square region with exactly n horizontal dimers and m monomers.at n=32A192096
• E.g.f. satisfies: A(A(x)) = x*exp(A(x)), where A(x) = Sum_{n>=1} a(n)/(n!*2^(n-1)).at n=7A193341
• Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 10.at n=17A195069
• Number of (n+1) X (n+1) 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock differing from the number in all its horizontal and vertical neighbors.at n=9A205064
• Numbers that are not the sum of two squares and two fourth powers.at n=19A214891
• Bit reversed 16-bit numbers.at n=29A217589