33645

Appears in sequences

• 53 'Reverse and Add' steps are needed to reach a palindrome.at n=19A065320
• Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros.at n=52A126442
• 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=13A153748
• The total number of ways of partitioning the multiset {1,1,1,2,3,...,n-2}.at n=7A169587
• Number of ways to select 4 numbers from the set of the first n natural numbers avoiding 3-term arithmetic progressions.at n=29A300760
• Number of integer partitions of n with unimodal run-lengths.at n=42A332280
• Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=58A346426
• Number of partitions of the (n+7)-multiset {0,...,0,1,2,...,7} with n 0's.at n=3A346860
• Expansion of e.g.f. log( 1 + (exp(x) - 1)^2 / 2 ).at n=7A346974