25631

Appears in sequences

• Number of asymmetric rooted polygonal cacti with bridges (mixed Husimi trees).at n=12A035353
• Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.at n=25A070818
• Numbers n such that twice the sum of the prime factors of n equals the product of the digits of n.at n=33A125309
• a(n) = a(n-1) + a(n-3) + a(n-4), with a(0)=a(1)=a(2)=a(3)=1.at n=23A126116
• Expansion of A(x) = (1 + 2*x^2 + 6*x^3 + 9*x^4 + 8*x^5 + 5*x^6) / (1 - x - 2*x^2 - 3*x^3 - 3*x^4 - 2*x^5 - x^6).at n=10A187004
• a(n) = ( a(n-1) * a(n-3) + a(n-2) ) / a(n-4), a(1) = a(2) = 1, a(3) = -1, a(4) = -4.at n=31A206282
• a(n) = F(n+1)^2 + F(n+1)*F(n) - F(n)^2, where F = A000045.at n=11A236428
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 366", based on the 5-celled von Neumann neighborhood.at n=49A287854
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 2, a(1) = 1, a(2) = 0, a(3) = 1.at n=23A295683
• Number of nX4 0..1 arrays with every element unequal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=14A317737
• Numbers w such that (F(2*n-1)^2, -F(2*n)^2, w) are primitive solutions of the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).at n=5A337929
• a(n) = F(n)*F(n+1) mod L(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.at n=21A348592
• Numbers k such that A372692(k) = A372692(k+1) > 1.at n=3A372693