30701

Appears in sequences

• Number of partitions of n that do not contain 1 as a part.at n=50A002865
• Multiples of 11 with digit sum 11, with no zero digits in odd places.at n=31A083512
• Number of partitions of n including 3, but not 1.at n=52A085811
• a(n) = (A085249(n) - 1)/6.at n=32A088349
• Number of partitions of n into parts not less than the smallest prime factor of n.at n=49A097360
• Number of partitions of n with unique smallest part and unique largest part.at n=49A117298
• Number of ways to build a contiguous building with n LEGO blocks of size 1 X 6 on top of a fixed block of the same size so that the building is flat, i.e., with all blocks in parallel position.at n=3A123800
• a(1)=1, a(n) = a(n-1) + n^3 if n odd, a(n) = a(n-1) + n^2 if n is even.at n=20A140154
• 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), (-1, 1, 1), (0, 0, 1), (1, 0, -1), (1, 0, 1)}.at n=8A150422
• Bisection (even part) of number of partitions that do not contain 1 as a part A002865.at n=25A182746
• Number of partitions of n that do not contain parts less than the smallest part of the partitions of n-1.at n=49A187219
• Terms of the Leibniz formula (as Euler product) that generate successively better approximations to Pi.at n=17A261208
• Numbers k such that 2*10^k - 27 is prime.at n=21A282571
• a(n) is the number of decompositions of F(n,1) into disjoint unions of F(j,k) and G(q,r) where F(j,k) is the set of numbers { i*k, 0 <= i <= j } and where G(q,r) is the set of numbers { (2*p-1)*r, 1 <= p <= q }.at n=25A335631
• One third the number of solid partitions of n with 5 parts.at n=33A387998