19750

Appears in sequences

• The Wiener index of the comb-shaped graph |_|_|...|_| with 2n (n>=1) nodes. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph.at n=29A192023
• Numbers n such that n = Sum_{j>=1} c(j) where c(0) = n, c(j) = floor(c(j-1)/10^k)*(c(j-1) mod 10^k) for j>0, and k is half the number of digits of n, rounded up if the number of digits of n is odd.at n=5A258584
• Number of n X 4 integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=5A266127
• T(n,k) = Number of n X k integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=41A266131
• Number of 6Xn integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=3A266136
• Number of n X n 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=3A278771
• Number of nX4 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=3A278774
• T(n,k)=Number of nXk 0..1 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly two mistakes.at n=24A278778
• Expansion of Product_{k>=1} (1 + x^(k^2))^(k^2).at n=50A291649
• Sum of the seventh largest parts in the partitions of n into 8 parts.at n=48A308991
• Terms appearing more than once in A309940, in ascending order.at n=7A328257
• The binary expansion of a(n) is the first n terms of 2 - A000002.at n=15A329356
• a(n) = 5^(2*n) * [x^n] Product_{k>=1} 1/(1 - 2*x^k)^(1/5).at n=3A370733
• a(n) = a(n-1) + a(n-3), with a(0) = 1, a(1) = 4, a(2) = 8.at n=23A385633