42588

Appears in sequences

• Triangle, read by rows, where row n equals the inverse binomial transform of the crystal ball sequence for D_n lattice.at n=48A108556
• Minimal m > 0 such that Fibonacci(m) == 0 (mod n^3).at n=38A132633
• Iterative mapping: a(1)=1, a(n)=A179216(a(n-1)).at n=13A179222
• Numbers k such that sopfr(k + omega(k)) = sopfr(k), where sopfr(i) = A001414(i) and omega(i) = A001221(i).at n=31A187878
• Numbers with prime factorization pq^2r^2s^2.at n=24A189344
• 0-sequence of reduction of (3n) by x^2 -> x+1.at n=15A192307
• Number of (n+2)X(n+2) binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=2A202484
• Number of (n+2)X5 binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=2A202487
• T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 010 in rows, columns and nw-to-se diagonals.at n=12A202492
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 9, n >= 2.at n=37A214376
• Numbers m that can be written as x*y with phi(x)*sigma(y) = 2*x*y, where x and y are positive integers, phi(.) is Euler's totient function and sigma(y) is the sum of all positive divisors of y.at n=37A279915
• Numbers k such that A007947(k) divides sigma(k) and A003557(k)-1 either divides A326143(k) [= A001065(k) - A007947(k)], or both are zero.at n=14A336550
• Exponential admirable numbers: numbers k such that there is a proper exponential divisor d of k such that esigma(k) - 2*d = 2*k, where esigma is the sum of exponential divisors function (A051377).at n=37A336680
• Consider primitive pairs of integers (b, c) with b < 0 such that x^5 + b*x + c = 0 is irreducible and solvable by radicals: sequence gives values of c.at n=15A371558
• Exponential unitary abundant numbers: numbers k such that A322857(k) > 2*k.at n=36A383693
• Exponential squarefree exponential abundant numbers: numbers k such that A361174(k) > 2*k.at n=35A383697
• Primitive terms of A388036.at n=44A388037
• Cubefree exponential abundant numbers: cubefree numbers k for which A051377(k) > 2*k.at n=32A391427