38368

Appears in sequences

• Expansion of Product_{m>=1} (1 + m*q^m)^16.at n=5A022644
• Row sums of A026584.at n=12A026596
• Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 21 (most significant digit on right).at n=24A029514
• Number of equilateral triangles formed out of matches that can be found in a hexagonal chunk of side length n in hexagonal array of matchsticks.at n=22A045949
• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(2) = 4.at n=42A050039
• Numbers m such that 2*phi(m) = phi(m+1).at n=30A050472
• Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3) = j^3 + k^3, ordered by increasing i; sequence gives i values.at n=16A054205
• a(n) = 2^n mod Fibonacci(n).at n=23A057862
• a(1)=0, a(n) = n^3 - a(n-1).at n=41A153026
• a(n) = 2*n*A071148(n).at n=21A177082
• Number of ways to place 7 nonattacking bishops on an n X n board.at n=5A187239
• a(n) = 4*n*(21*n - 26).at n=22A263229
• The second Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.2).at n=23A292345
• Number of strict solid partitions of n.at n=30A323657
• Coefficient of x^n in the expansion of ( 1/(1-x) * (1+x^2)^3 )^n.at n=7A370244
• Total number of ways to place k nonattacking bishops on an n X n chess board. Triangle T(n,k) read by rows (0 <= k <= 2*n-[n>0]-[n>1]).at n=34A378590