20250

Appears in sequences

• Take n-th prime p, let P(p) = all primes that can be obtained by permuting the digits of p and possibly adding or omitting zeros; a(n) = |p-q| where q in P(p) is the closest to p but different from p (a(n)=0 if no such q exists).at n=54A052999
• Smallest integer >= 0 of the form x^3 - n^4.at n=34A070930
• Numbers n divisible by exactly two nontrivial permutations (rearrangements) of the digits of n.at n=17A090057
• A certain partition array in Abramowitz-Stegun order (A-St order), called M_3(5).at n=21A134273
• Numbers of the form p^4*q^3*r where p, q, and r are distinct primes.at n=25A179698
• Triangle read by rows of products of (signless) Stirling numbers of the first kind (A132393) and Stirling numbers of the second kind (A008277).at n=24A187556
• Mobius transform of A008457.at n=29A190623
• Completely multiplicative function with a(prime(k)) = prime(k)*prime(k+1).at n=53A191002
• Number of ways to place 2 nonattacking nightriders on an n X n toroidal board.at n=14A196812
• Number of nX4 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=4A231033
• T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=32A231037
• Number of 5Xn 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=3A231041
• a(n) = 6*n^3.at n=15A244726
• From higher-order arithmetic progressions.at n=2A259458
• Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1).at n=21A260443
• Even terms in A260442 (in A260443).at n=14A277200
• Odd bisection of A260443 (the even terms): a(n) = A260443((2*n)+1).at n=10A277324
• Record values in A260443.at n=11A277703
• a(n) = n^3 if n odd, 3*n^3/4 if n even.at n=30A309337
• The sixth moments of the alternated squared binomial coefficients; a(n) = Sum_{m=0..n} (-1)^m*m^6*binomial(n, m)^2.at n=5A329521