44641044

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*6^j.at n=30A038296
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*12^j.at n=29A038302
• p^11 * A000594(p) as p runs through the primes.at n=1A079400
• Numbers n such that (A000203(n)+28)/n is an integer.at n=27A162302
• a(n) = binomial(n + 3, 3)*9^n.at n=6A173187
• a(n) = 2*n*3^(n-1).at n=13A212697
• Triangular array read by rows: T(n, k) is the number of rooted forests on {1, 2, ..., n} in which one tree has been specially designated that contain exactly k trees; n >= 1, 1 <= k <= n.at n=38A225465
• Number of shapes of balanced 9-ary trees with n nodes, where a tree is balanced if the total number of nodes in subtrees corresponding to the branches of any node differ by at most one.at n=16A229394
• Smallest number m such that repeated application of A235600 takes n steps to reach 1, where A235600(k) = k/A007953(k) if the digital sum A007953(k) divides k, A235600(k) = k otherwise.at n=7A235601
• Triangle read by rows: T(n,k) = coefficient of [x^(n-k)] in the expansion of the polynomial (x+n)^n.at n=51A243594
• 3-deficient numbers with increasing abundancy: Numbers k such that sigma(m)/m < sigma(k)/k < 3 for all numbers m < k such that sigma(m)/m < 3.at n=30A307122
• The total number of big inversions in all parking functions of length n.at n=7A386861
• Position of records in A389235.at n=6A389302