25068

Appears in sequences

• Number of ways to partition the set of divisors of n into three subsets such that their sums form an integer triangle.at n=59A091234
• Number of ways to partition the set of divisors of the n-th abundant number into three subsets such that their sums form an integer triangle.at n=11A091235
• Round(1000*x), where x is the solution to x = 3^(n-x).at n=28A103537
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having three, four, six or seven distinct values for every i,j,k<=n.at n=6A211739
• Number of alternately co-strong integer partitions of n.at n=44A317256