23610

Appears in sequences

• For a number k of length L, let f(k) be the sum of the products of the first i digits of k multiplied by the last L-i digits, for i from 1 to L-1, e.g., f(1234) = 1*234 + 12*34 + 123*4 = 1134. Sequence gives k such that f(k) = k.at n=9A065759
• Number of digraphs with labeled vertices and labeled arcs, with n arcs and with no vertex of indegree 0 or outdegree 0.at n=5A121936
• Coefficients of Laguerre recursive polynomials with an (n+2)!/2 multiplication factor and alpha=a0 =0 from Hochstadt: P(x, n) = (2*n + a0 + 1 - x)*P(x, n - 1)/(n + 1) - n*P(x, n - 2)/(n + 1);.at n=42A136533
• Number of nX6 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=6A229443
• Number of 7 X n 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and rows and columns lexicographically nondecreasing.at n=5A229450
• Consider any concatenation of the type n = concat(a,b). Sequence lists numbers that are the sum of the products of some of such couples a and b.at n=31A265737
• Number of nX3 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=3A279524
• Number of nX4 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A279525
• T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=17A279527
• T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=18A279527
• a(n) = Sum_{i=0..n} i*T(i)^2, where T(i) = A000073(i) is the i-th tribonacci number.at n=9A337283
• a(n) is the smallest number that can be partitioned into n ways as the sum of two Moran numbers.at n=40A337862
• Number of partitions of the (n+3)-multiset {0,...,0,1,2,3} with n 0's into distinct multisets.at n=22A346823