111554

Appears in sequences

• Sum of fourth powers of unitary divisors.at n=17A034678
• Take the first 2n integers and using each integer once and only once as either a numerator or a denominator, construct n fractions whose sum is an integer; a(n) = number of distinct solutions for n.at n=7A060146
• Numbers k that divide 3^(k^3) + 1.at n=8A092408
• Number of 3-cycles in the n X n black bishop graph.at n=34A289161
• Smallest integer N such that all numbers from 1 to n (n being N's rank in the sequence) can be built by the sum of contiguous digits of N.at n=16A296447
• Array read by downward antidiagonals: A(n,k) = Sum_{i=0..n-1} Sum_{j=0..k+1} binomial(n-1,i)*binomial(k+1,j)*A(i,j) with A(0,k) = 1, n >= 0, k >= 0.at n=48A383410