39066

Appears in sequences

• Integers that are Rhonda numbers to base 16.at n=15A100975
• Number of parts in all partitions of n in which every integer from the smallest part to the largest part occurs as a part.at n=43A117457
• a(n) = Sum_{y=1..n} Sum_{x=1..n} floor((x^k + y^k)^(1/k)) with k = 2.at n=36A211791
• Numbers of the form (5^j + 7^k)/2, for j and k >= 0.at n=43A226792
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=10A249171
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=16A249171
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=23A249171
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=31A249171
• T(n,k)=Number of length n+6 0..k arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=40A249171
• Number of length 1+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249172
• Number of length 2+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249173
• Number of length 3+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249174
• Number of length 4+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249175
• Number of length 5+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249176
• Number of length 6+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249177
• Number of length 7+6 0..n arrays with every seven consecutive terms having four times the sum of some three elements equal to three times the sum of the remaining four.at n=4A249178
• E.g.f. A(x) satisfies: Sum_{n>=0} (-x)^n/n! * Product_{k=0..n} (n-k) + (k+1)*A(x) = 1.at n=5A306067
• Number of separable partitions of n that consist of an odd number of parts.at n=45A325724
• Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when connecting infinite lines between all vertices and all points that divide the sides of an equilateral triangle into n equal parts, for k = 3, 4, ..., max_k.at n=53A346446