37752

Appears in sequences

• Composite a(n) divided by the palindromic sum of its prime factors is a palindrome (counted with multiplicity).at n=7A046361
• Expansion of (1-x)^(-1)/(1 - 2*x - x^2 - x^3).at n=11A077849
• Triangle of binomial(n,k)*(binomial(n+k,k)-binomial(n+k-2,k-1)).at n=43A080721
• Numbers n such that n + (sum of prime factors of n) = next prime after n.at n=39A105779
• Triangle read by rows: T(i,j) = (T(i-1,j) + i)*i.at n=31A121682
• Triangle of coefficients of polynomials u(n,x) jointly generated with A207623; see the Formula section.at n=52A207622
• a(1) = least k such that 1/2 + 1/3 < H(k) - H(3); a(2) = least k such that H(a(1)) - H(3) < H(k) -H(a(1)), and for n > 2, a(n) = least k such that H(a(n-1)) - H(a(n-2)) > H(k) - H(a(n-1)), where H = harmonic number.at n=9A227653
• Numbers k such that k = rad(k) * sopfr(k), where rad(k) is the squarefree kernel of k and sopfr(k) the integer log of k.at n=17A280935
• Number of n X n 0..1 arrays with every element equal to 1, 2, 4 or 7 king-move adjacent elements, with upper left element zero.at n=16A298088
• a(n) = Sum_{i+j<=m+1} t_i * t_j, where t_1 < ... < t_m are the totatives of n.at n=38A341063