19393

Appears in sequences

• 4-white numbers: partition digits of n^4 into blocks of 4 starting at right; sum of these 4-digit numbers equals n.at n=10A037044
• Number of partitions of n where n divides the product of the parts.at n=48A057568
• a(n) = 11*n^2 + 22*n.at n=40A067705
• Integers k such that 10^k + 31 is prime.at n=13A107083
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=8A150162
• Symmetrical triangle sequence from polynomials: q(x,n)=(-1)^n*(Sum[(k + 1)^n*x^k/k, {k, 1, Infinity}] + Log[1 - x])*(x - 1)^n/x; p(x,n)=q(x,n)+x^n*q(1/x,n).at n=46A154989
• Smallest k>0 such that (5^n-k)*5^n-1 and (5^n-k)*5^n+1 are a twin prime pair or 0 if no such k exists.at n=45A212488
• a(n) = 12*n^4 + 16*n^3 + 10*n^2 + 4*n + 1.at n=6A272124
• Harary index of the n X n black bishop graph.at n=22A296198
• Number of n X 6 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=2A303100
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=30A303102
• Number of 3Xn 0..1 arrays with every element equal to 1, 2, 3, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A303103