39852

Appears in sequences

• McKay-Thompson series of class 9A for Monster.at n=11A007266
• Numbers k that divide the (right) concatenation of all numbers <= k written in base 3 (most significant digit on left).at n=33A029448
• Dirichlet convolution of 3^(n-1) with itself.at n=9A034751
• McKay-Thompson series of class 9A for the Monster group with a(0) = 3.at n=11A045491
• a(n) = (n+1)(n+2)^3*(n+3)(n^2 + 4n + 5)/120.at n=7A114239
• Expansion of (eta(q^3)^2 / (eta(q) * eta(q^9)))^6 in powers of q.at n=11A131985
• Numbers m having more than one representation as k*(1+phi(k)/2), where phi(k) is Euler's totient function.at n=2A186309
• Number of (n+1) X 3 0..2 arrays with the number of equal 2 X 2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=3A205329
• Number of (n+1)X5 0..2 arrays with the number of equal 2X2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=1A205331
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of equal 2X2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=11A205335
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of equal 2X2 subblock diagonal pairs and equal antidiagonal pairs differing from each horizontal or vertical neighbor, and new values 0..2 introduced in row major order.at n=13A205335
• Number of (n+2)X(n+2) 0..1 arrays with nondecreasing maximum of every three consecutive values in every row and column.at n=1A250567
• Number of (n+2)X(2+2) 0..1 arrays with nondecreasing maximum of every three consecutive values in every row and column.at n=1A250568
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with nondecreasing maximum of every three consecutive values in every row and column.at n=4A250574
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=38A268503
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 353", based on the 5-celled von Neumann neighborhood.at n=39A271307
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 601", based on the 5-celled von Neumann neighborhood.at n=15A283221
• Number of partitions consisting of n parts, each of which is a power of 2, where one part is 1 and no part is more than twice the sum of all smaller parts.at n=11A339479
• Number of permutations of degree n with highest Shannon entropy.at n=8A341838
• Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 3 vertices and the equally spaced 3*n points placed on the sides of an equilateral triangle when every pair of the 3 + 3*n points are connected by a circle and where the points lie at the ends of the circle's diameter.at n=60A372734