26587

Appears in sequences

• Number of n-node rooted trees of height 4.at n=15A000299
• a(n) = n*(5*n^2 - 3)/2.at n=22A063522
• Numerator of Sum_{k=1..n} k/phi(k).at n=19A068885
• Number of nonisomorphic partitions of n on the Ferrers diagram.at n=42A095814
• Number of (ordered) sequences of coins (each of which has value 1, 5, 10, 25, 50 or 100) which add to n.at n=36A114044
• A bisection of A063522.at n=11A160699
• a(n) = A154798(n)/2.at n=9A163288
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=2|x-y|-|y-z|.at n=33A212577
• Numbers k such that 2*k is a partition number.at n=17A213179
• Number of (n+1)X(5+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero.at n=1A232073
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero.at n=16A232076
• Number of (2+1) X (n+1) 0..1 arrays with every element equal to some horizontal, diagonal or antidiagonal neighbor, with top left element zero.at n=4A232078
• G.f. A(x) satisfies: A( x*A(x) - A(x)^3 ) = x^2.at n=8A268039
• Numerator of P(n)/Q(n) = A000041(n)/A000009(n).at n=42A330994
• Number of compositions of n into parts of size 1, 5, 10 or 25.at n=36A351724
• Number of rooted binary normal unlabeled galled trees with n leaves and exactly 1 gall.at n=12A380256
• Irregular triangle read by rows: T(n,k) is the number of rooted binary normal unlabeled galled trees with n leaves and exactly k galls, 0 <= k <= floor((n-1)/2).at n=37A380306