52800

Appears in sequences

• a(n) = (2*n-1)*(n^2 -n +2)/2.at n=37A063488
• Composite numbers k+1 such that k*phi(k+1) is a perfect square.at n=32A069068
• Non-palindromic numbers such that either x=q1.Rev[x] or Rev[x]=q2.x, where R[x]=A004086[x] and q1 or q2 are integers not divisible by 10.at n=23A071687
• a(n) = A062401(2^n + 1).at n=17A096855
• a(n) = sigma((7^n - 1)/6), where sigma(n) is the sum of positive divisors of n.at n=5A102360
• A second version of Fibonacci factorials besides A003266.at n=4A123741
• Experience Points thresholds for levels in the pen and paper role-playing game "Das Schwarze Auge" (DSA, a.k.a. "The Dark Eye").at n=32A124437
• Number of permutations of 5 indistinguishable copies of 1..n with exactly 3 adjacent element pairs in decreasing order.at n=2A151648
• Triangle of the RBS1 polynomial coefficients.at n=24A160485
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k 3-term arithmetic progressions (n>=0; 0<=k<=floor((n-1)^2/4)).at n=50A162982
• Triangle in which the g.f. for row n is [Sum_{k>=0} C(n+k-1,k)^3*x^k]*(1-x)^(3n+1), read by rows of k=0..2n terms.at n=28A181544
• Triangle in which the g.f. for row n is [Sum_{k>=0} C(n+k-1,k)^3*x^k]*(1-x)^(3n+1), read by rows of k=0..2n terms.at n=32A181544
• Numbers with prime factorization pqr^2s^6.at n=8A190474
• Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(5*n+1,i) * binomial(k+5-i,5)^n, 0 <= k <= 5*(n-1).at n=10A237202
• Irregular triangle read by rows: T(n,k) = Sum_{i=0..k} (-1)^i * binomial(5*n+1,i) * binomial(k+5-i,5)^n, 0 <= k <= 5*(n-1).at n=14A237202
• a(n) = Sum_{0 < x,y,z <= n and gcd(x^2 + y^2 + z^2, n)=1} gcd(x^2 + y^2 + z^2 - 1, n).at n=29A239612
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 241", based on the 5-celled von Neumann neighborhood.at n=21A280144
• a(n) = 3*n*(n^2 + 3*n + 4).at n=25A280304
• The number of positive integer sequences of length n with no duplicate substrings of length greater than 1, every number different from its neighbors, and a minimal sum (= A282166(n)).at n=16A284431
• Triangle read by rows: T(n, m) = A285061(n, m)*m!, 0 <= m <= n.at n=17A285066