23560

Appears in sequences

• Numbers k such that usigma(k) = phi(k)*omega(k), where omega(k) is the number of distinct prime divisors of k.at n=16A063795
• Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along rows.at n=35A072333
• Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=42A111036
• Numbers whose square root in base 10 starts with 10 distinct digits.at n=12A113507
• Partial products of A005448.at n=5A140701
• Pascal triangle shifted MacMahon numbers: p(x,n)=If[n < 2, -(-2)^n*(x - 1)^(n + 1)*LerchPhi[x, -n, 1/2], 2*x*(x + 1)^(n - 2) - (-2)^n*(x - 1)^(n + 1)*LerchPhi[x, -n, 1/2]].at n=24A147295
• G.f. satisfies: A(x) = 1 + x * sqrt( d/dx x*A(x)^4 ).at n=6A213192
• Sum of the divisors of n^3 - 1.at n=24A234860
• Number of binary words of length n with exactly 5 (possibly overlapping) occurrences of the subword given by the binary expansion of n.at n=26A236234
• Partial sums of A147562.at n=40A272928
• Number of compositions (ordered partitions) of n into parts with an even number of prime divisors (counted with multiplicity).at n=27A286227
• Partial sums of A299037.at n=51A299767
• a(n) = n*((2*n + 1)*(2*n^2 + 2*n + 3) - 3*(-1)^n)/24.at n=19A325517
• Number of rooted maps of genus 1 with n edges.at n=4A361138
• Expansion of g.f. A(x) satisfying A(x) = 1 + x*G(x)^5, where G(x) = 1 + x*(G(x)^3 + G(x)^5) is the g.f. of A363311.at n=5A363310
• Numbers k such that k - A067666(k) is a square.at n=42A386304