61966

Appears in sequences

• a(n) = T(n,n) + T(n,m+1) + ... + T(n,n), where m=[ (n+2)/2 ], T given by A027011.at n=14A027021
• Number of partitions p of n such that the number of parts having multiplicity 1 is a part or max(p) - min(p) is a part.at n=45A241451
• Number T(n,k) of isoscent sequences of length n with exactly k ascents; triangle T(n,k), n>=0, 0<=k<=n+3-ceiling(2*sqrt(n+2)), read by rows.at n=52A242351
• Number of isoscent sequences of length n with exactly six ascents.at n=2A243232
• Integers k such that 28*phi(29*197^3*k) is not a totient number where phi is the totient function.at n=15A361396
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of (B(x)/x)^k, where B(x) is the g.f. of A376176.at n=60A384621