49680

Appears in sequences

• Number of domino tilings of a certain region.at n=4A007762
• Number of rooted connected graphs on n labeled nodes where the root has degree 2.at n=3A038095
• Triangle of D-analogs of Stirling numbers of the 2nd kind.at n=58A039761
• Numbers k such that 2^k - 1 is divisible by (k-1).at n=32A087965
• G.f. satisfies: A(x) = 1 + x*A(x)*d/dx[x*A(x)] = 1 + x*A(x)^2 + x^2*A(x)*A'(x).at n=7A088716
• a(n) = A028491(n) - 1.at n=14A090747
• Triangle T, read by rows, such that the matrix inverse satisfies: [T^-1](n,k) = -(k+1)*T(n-1,0) for n>k>=0, with T(n,n)=1 for n>=0.at n=28A112911
• Phi(A033631(n)) {phi is the Euler totient function A000010}.at n=21A115620
• Numbers k such that if you subtract k-reversed from k you get a natural number with the same digits as k.at n=13A121969
• Numbers with prime factorization pqr^3s^4.at n=11A190294
• Numbers n such that A000203(2*n) divides 2*n*A045917(n).at n=22A245629
• Positive numbers m such that m^2 - 1 divides 2^m - 1.at n=16A247219
• Positive numbers m such that m^2 - 1 divides 4^m - 1.at n=29A271842
• Numbers k such that k+1 is a prime, k+2 is twice a prime, k+3 is three times a prime, and k+4 is four times a prime.at n=4A278585
• Numbers i such that Fibonacci(i) is divisible by i, i+1, i+2, and i+3.at n=17A298685
• Numbers i such that Fibonacci(i) is divisible by i+k for k=0,1,2,3,4.at n=4A298686
• Table of row functions R(n,x) that satisfy: [x^k] exp( k * R(n,x) ) = k^n * [x^(k-1)] exp( k * R(n,x) ) for k>=1, n>=1, read by antidiagonals.at n=35A300620
• Table of row functions R(n,x) that satisfy: [x^k] exp( k^n * R(n,x) ) = k^n * [x^(k-1)] exp( k^n * R(n,x) ) for k>=1, n>=1, read by antidiagonals.at n=35A300625
• G.f. A(x,y) satisfies: A(x,y) = x * (1 + y*A(x,y)*A'(x,y)) / (1 + A(x,y)*A'(x,y)), where A'(x,y) = d/dx A(x,y).at n=35A301930