48300

Appears in sequences

• Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite SGT = Sigma-2 [Si64O128].4R starting with a T3 atom.at n=14A019236
• Number of upward triangles in a Star of David matchstick arrangement of size n.at n=21A045950
• Numbers k such that k^6 + 1091 is prime.at n=29A066386
• Even triangle n!. This table read by rows gives the coefficients of sum formulas of n-th factorials (A000142). The k-th row (6>=k>=1) contains T(i,k) for i=1 to k+3, where k=[2*n+1+(-1)^(n-1)]/4 and T(i,k) satisfies n! = Sum_{i=1..k+3} T(i,k) * n^(i-1) / (2*k-2)!.at n=19A102409
• Order of the following permutation on 3n+1 symbols. Write the 3n+1 symbols horizontally into a 3-column grid and read them off vertically, i.e., column after column.at n=33A119980
• Numbers with prime factorization pqrs^2t^2.at n=25A189989
• Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 30, and no two adjacent values equal.at n=5A233885
• Number of (n+1)X(6+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30, and no two adjacent values equal.at n=0A233890
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.at n=15A233892
• T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal.at n=20A233892
• a(n) is the smallest number which has a water-capacity of n.at n=16A275339
• a(n) is the smallest number that has exactly n odious divisors (A000069).at n=38A355968
• a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero tetrahedral numbers in exactly n ways, or -1 if no such integer exists.at n=28A360217
• a(n) = A375251(n) / A010790(n) = denominator(W1([n], x)) / (n!*(n - 1)!), where W1([n], x) is the first Sylvester wave for parts in [n].at n=44A375250