44640

Appears in sequences

• Theta series of {D_9}* lattice.at n=40A008424
• Theta series of D_9 lattice.at n=5A008431
• Theta series of {D_9}^{+} packing.at n=40A008436
• Number of ways of writing n as a sum of 9 squares.at n=10A008452
• a(n) = floor( n*(n-1)*(n-2)*(n-3)/22 ).at n=33A011932
• Number of squares (of another matrix) in the group GL(2,Z_n) described in sequence A000252.at n=17A068516
• Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k UH's, where U=(1,1), H=(1,0) (0<=k<=floor(n/3)).at n=48A114576
• The RSEG2 triangle.at n=47A161739
• Third left hand column of the RSEG2 triangle A161739.at n=7A161742
• Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k vertices of outdegree 2 that have (two) leaves as their (two) children.at n=38A178519
• Numbers with prime factorization pqr^2s^5.at n=18A190293
• Number of n X n 0..6 matrices with each 2X2 subblock idempotent.at n=11A224663
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 187", based on the 5-celled von Neumann neighborhood.at n=39A270675
• Solutions x of uphi(x)/x = 2/3, where uphi is the unitary phi function (A047994).at n=7A305678
• T(n,k) = [x^n] JacobiTheta3(0,x)^k, for 0 <= k <= n, triangle read by rows.at n=63A319935
• Numbers k such that k and uphi(k) have the same set of prime divisors, where uphi is the unitary totient function (A047994).at n=27A329859
• The number of regions inside a hexagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.at n=5A331931
• Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^binomial(k+5,6).at n=14A344206
• Number A(n,k) of n-tuples (p_1, p_2, ..., p_n) of positive integers such that p_{i-1} <= p_i <= i^k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=48A355614
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of regions in the resulting planar graph.at n=39A367323