152460

Appears in sequences

• Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).at n=31A046366
• Denominators of first difference of squares of harmonic numbers A001008/A002805.at n=10A103933
• Number of tree-rooted maps of genus 1 with n edges: rooted maps on the torus with a distinguished spanning tree.at n=4A118445
• Numbers with prime factorization pqr^2s^2t^2.at n=9A190379
• Triangle t(n,r) = s(n,r)*s(n,r+1), where s(n,r) = lcm(n,n-1,...,n-r+1)/lcm(1,2,...,r-1,r), n >= 1 and 0 <= r < n.at n=59A241475
• a(n) = (4*n+8)*n^2.at n=33A258617
• Number of ordered set partitions of [n] where the maximal block size equals eight.at n=4A320764
• The number of walks of length 2n+1 on the square lattice that start from the origin (0,0) and end at the vertex (2,1).at n=4A337902
• Numbers k such that A065642(k) = A081761(k).at n=12A340306
• T(n, k) = ((2*n + 1)/2)*Sum_{j, k, n} (-1)^(k + j)*(n + j)*binomial(2*n, n - j)* Stirling2(n - k + j, 1 - k + j) with T(0, 0) = 1. Triangle read by row, T(n, k) for 0 <= k <= n.at n=33A342312
• Triangle T(n, m) = binomial(n+2, m)*binomial(n+2, n-m), read by rows.at n=49A348539
• Triangle T(n, m) = binomial(n+2, m)*binomial(n+2, n-m), read by rows.at n=50A348539
• Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).at n=48A352880
• Triangle read by rows: T(n,k) is the number of forests of labeled rooted Greg hypertrees with n white vertices and k black vertices, 0 <= k < n.at n=26A370949