33728

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (odd natural numbers).at n=27A025083
• Schoenheim bound L_1(n,6,5).at n=26A036833
• Total number of prime parts in all partitions of n.at n=31A037032
• C(n-3,3)+C(n-7,7)+...+C(n-(4*floor((n-4)/4)+3),4*floor((n-4)/4)+3).at n=25A101552
• 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, 1), (0, 1, 0), (1, 0, 0), (1, 1, -1)}.at n=10A149823
• Triangle interpolating the swinging factorial (A056040) restricted to odd indices with its binomial transform. Same as interpolating the beta numbers 1/beta(n,n) (A002457) with (A163869). Triangle read by rows, for n >= 0, k >= 0.at n=22A163842
• Number of binary strings of length n with equal numbers of 0010 and 1101 substrings.at n=17A164173
• Number of right triangles on a (n+1)X8 grid.at n=17A189812
• Number of partitions p of n not including round(mean(p)) as a part. (This is "Mathematica round"; for round(x) defined as floor(x + 1/2), see A241734.)at n=44A241339
• Number of partitions p of n such that round(mean(p)) is not a part of p; here, round(x) means floor(x + 1/2).at n=44A241734
• Least number m such that there exist exactly n pairs of numbers (a,b), 0 < a < b < m, such that a+b, a+m, and b+m are all squares.at n=38A246766
• Total number of inversions in all compositions of n into distinct parts.at n=24A271372
• Bi-unitary near-perfect numbers: bi-unitary abundant numbers k such that the abundance d = bsigma(k) - 2*k is a bi-unitary divisor of k, where bsigma(k) is the sum of bi-unitary divisors of k (A188999).at n=40A303359
• a(n) = n*(n+1)*(n+3).at n=31A317637
• Product_{n>=1} (1 + a(n)*x^n) = 1 + Sum_{n>=1} sigma(n)*x^n, where sigma = A000203.at n=23A353924
• Expansion of 1/(1 - 4*x/(1-x))^(3/2).at n=6A377197
• Numbers k such that A224787(k) - k is a square.at n=37A385238
• Expansion of sqrt((1-x) / (1-5*x)^5).at n=5A387228