22519

Appears in sequences

• Number of partitions of n that do not contain 1 as a part.at n=48A002865
• a(n) = (1/C(n,0) - 1/C(n,1) + ... + d/C(n,k))*L, where d = (-1)^k,k = [ n/2 ], L = LCM{C(n,0), C(n,1),..., C(n,n)}.at n=14A025536
• Numbers whose base-4 representation contains exactly four 1's and four 3's.at n=3A045133
• Number of partitions of n including 3, but not 1.at n=50A085811
• Number of partitions of n into parts not less than the smallest prime factor of n.at n=47A097360
• Number of partitions of n with unique smallest part and unique largest part.at n=47A117298
• 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, 0, 1), (0, 0, 1), (1, -1, -1), (1, 1, 0)}.at n=8A150202
• Bisection (even part) of number of partitions that do not contain 1 as a part A002865.at n=24A182746
• Number of partitions of n that do not contain parts less than the smallest part of the partitions of n-1.at n=47A187219
• a(n) = ceiling((3n+1/n)^n).at n=3A197717
• Round((3*n+1/n)^n).at n=3A197976
• Indices of the start of 10 successive distinct digits in the decimal expansion of e (2.718281828...).at n=19A258166
• Number of triples 0 <= i, j, k < n such that bitwise AND of i, j, k is 0.at n=33A269589
• Expansion of Sum_{i>=1} mu(i)^2*x^i/(1 - x^i) / Product_{j>=1} (1 - mu(j)^2*x^j), where mu() is the Moebius function (A008683).at n=30A281572
• G.f.: Sum_{k>=0} x^(k^4) / Product_{j=1..k^4} (1 - x^j).at n=54A339235