44928

Appears in sequences

• Number of paraffins.at n=22A006009
• T(n,[ n/2 ]), where T is the array defined in A026105.at n=15A026117
• Number of strings of length n over Z_6 with trace 1 and subtrace 0.at n=7A073977
• Number of strings of length n over Z_6 with trace 1 and subtrace 3.at n=7A073980
• Number of strings of length n over Z_6 with trace 3 and subtrace 2.at n=7A073991
• Number of strings of length n over Z_6 with trace 3 and subtrace 5.at n=7A073994
• G.f. A(x) defined by: A(x)^3 consists entirely of integer coefficients between 1 and 3 (A083953); A(x) is the unique power series solution with A(0)=1.at n=27A084203
• Smallest Smith number with n prime factors.at n=9A104168
• Highly decomposable Smith numbers. A Smith number which sets a record for the number of prime factors (counting multiplicity) starting from first Smith number is called a highly decomposable Smith number.at n=6A104169
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 0, 1), (1, 1, -1)}.at n=11A148320
• Numbers k such that there are 10 digits in k^2 and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square.at n=18A153748
• Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=3, read by rows.at n=23A154916
• Triangle T(n,m,p,q) = (p^(n-k)*q^k + p^k*q^(n-k))*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=3, read by rows.at n=25A154916
• Number of reducible Boolean polynomials of degree n with constant term 1.at n=19A169914
• Number of n X 4 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=16A208065
• a(n) = n^3 - floor(n/3)^3.at n=36A213039
• Triangle read by rows: T(n,k) = A059382(n)/(A059382(k)*A059382(n-k)).at n=47A238743
• Triangle read by rows: T(n,k) = A059382(n)/(A059382(k)*A059382(n-k)).at n=52A238743
• a(n) = (4*n+1) * (5*n+1)^(n-2) * 6^n.at n=3A251696
• Numbers n for which there exists k > n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.at n=9A255334