19197

Appears in sequences

• 9 times octagonal numbers: a(n) = 9*n*(3*n-2).at n=27A064201
• Number of partitions of n with unique smallest part and unique largest part.at n=46A117298
• Schroeder triangle sums: a(n) = A006603(n+3) - A006318(n+3) - A006319(n+2).at n=6A227505
• Number of partitions of 2n into parts such that the largest multiplicity equals n.at n=47A232697
• Where records occur in A239866.at n=10A239867
• G.f.: Product_{k>=1} (1+x^k)^(3*k+2).at n=9A255837
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=39A271158
• a(n) = (Sum_{i=1..n-1} i^(n-2)) mod n^3.at n=26A284759
• Consider the non-unitary aliquot parts, in ascending order, of a composite number. Take their sum and repeat the process deleting the minimum number and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to themselves.at n=9A307859
• Terms of A046337 for which A358777 is zero, where the latter is the Dirichlet inverse of former's characteristic function.at n=30A359607
• Triangle read by rows. T(n, k) = numerator([x^k] R(n, n, x)), where R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} x^j * binomial(u, j) * (j + 1)^n ) / (u + 1).at n=17A362996