47025

Appears in sequences

• a(n) = n^3 + (n+1)^3 + (n+2)^3.at n=24A027602
• [ exp(2/13)*n! ].at n=7A030932
• Numbers k that can be expressed as k = w+x = y*z with w*x = (y+z)^3 where w, x, y, and z are all positive integers.at n=26A057370
• Smallest odd number k such that p(2m)-2p(m)=k has exactly n solutions (where p(m) = m-th prime).at n=15A069890
• Primitive abundant numbers that set a new record for number of divisors.at n=8A083873
• Column limit of A127119.at n=9A127120
• a(n) = n^4 - n^3 - n^2.at n=15A132998
• The hyper-Wiener index of the triangular graph T(n) (n >= 1).at n=19A228317
• a(0)=1; a(n) = Sum_{k=1..n-1} d(k)*a(n-k), where d(m) is m-th bit in binary expansion of n.at n=26A260956
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 537", based on the 5-celled von Neumann neighborhood.at n=7A272791
• Triangle T read by rows: T(n, m), for n >= 2, and m=1, 2, ..., n-1, equals the positive integer solution x of y^2 = x^3 - A(n, m)^2*x with the area A(n, m) = A249869(n, m) of the primitive Pythagorean triangle characterized by (n, m) or 0 if no such triangle exists.at n=94A278711
• Coefficients of 1/(Sum_{k>=0} round((k+1)*r)(-x)^k), where r = 9/7.at n=19A289916
• Least odd primitive abundant number having its prime signature.at n=10A316116
• Number of different ways to partition the set of vertices of a convex (n+11)-gon into 4 nonintersecting polygons.at n=9A350286
• Primitive abundant numbers for which there is no smaller primitive abundant number having the same ordered prime signature.at n=21A357921
• G.f. A(x) satisfies A(x) = 1 + x + x^4*A(x)^3.at n=23A366556
• Numbers that are divisible by the squares of two distinct primes and whose arithmetic derivative (A003415) is a squarefree number of the form 4k+2.at n=9A368697
• Numbers k such that omega(k) = 4 and the largest prime factor of k equals the sum of its remaining distinct prime factors, where omega(k) = A001221(k).at n=27A383728