51488

Appears in sequences

• a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A026568.at n=4A027280
• Numbers n such that (273*2^n-1)^2-2 is prime.at n=49A100913
• Number of partitions of n in which the number of parts is relatively prime to n.at n=45A102628
• Triangle read by rows: T(n, k) = binomial(n, k)/Beta(n+1, n-k+1) + binomial(n, n-k)/Beta(n+1, k+1).at n=28A156052
• Triangle read by rows: T(n, k) = binomial(n, k)/Beta(n+1, n-k+1) + binomial(n, n-k)/Beta(n+1, k+1).at n=35A156052
• a(n) = 12*n^3 + 9*n^2 + 2*n.at n=16A191745
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 5 6 or 7.at n=9A252567
• Number of partitions of n*(n-1)/2 into at most four parts.at n=19A274099
• Number of horizontal steps in the valleys of all bargraphs having semiperimeter n (n >=2).at n=11A278135
• Least number x such that x^n has n digits equal to k. Case k = 1.at n=30A285448
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=30A285538
• Starts of runs of 4 consecutive positive negabinary-Niven numbers (A331728).at n=12A331824
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 4*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2*x - x^2.at n=33A367298