26950

Appears in sequences

• Numbers whose base-5 representation contains exactly three 0's and three 3's.at n=28A045202
• Triangle giving a(n,k) = number of (n,k) labeled Greg trees (n >= 2, 0 <= k <= n-2).at n=18A048159
• Numbers n such that A001414(n) = sum of composites from the smallest prime factor of n to the largest prime factor of n.at n=13A074053
• Logarithm of triangular matrix A102220, which equals [2*I - A008459]^(-1).at n=32A102222
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (1, -1, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150368
• a(n) = 22*n^2.at n=35A195323
• Triangular array of coefficients of polynomials q(n,k) defined in Comments.at n=40A248669
• Triangular array of coefficients of polynomials q defined in Comments; the coefficients are written in the order of decreasing powers of x.at n=40A248670
• Number of Dyck paths of semilength n such that each positive level has exactly four peaks.at n=17A288320
• Recurrence a(n+2) = Sum_{k=0..n} binomial(n,k)*a(k)*a(n+1-k) with a(0)=1, a(1)=-2.at n=10A289068
• Sum of the squares of the parts in the partitions of n into two distinct parts.at n=43A294286
• a(n) = n^2*(n*(4*n + 3) + 3*n*(-1)^n - 4)/96.at n=27A302758
• a(n) = A005940(1+A163511(n)).at n=65A335422
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 1.at n=25A380889
• Number of integer partitions of n with origin-to-boundary graph-distance equal to 4.at n=68A384562