80422
domain: N
Appears in sequences
- Let p(k) be the number of partitions of k (A000041); a(n) = Sum_{1<=k<=n, gcd(k,n)=1} p(k).at n=39A096223
- Expansion of Product_{k>=1} 1/(1-x^(3*k-2))^(3*k-2).at n=35A262947
- Number of n X n binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=4A269082
- Number of nX5 binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=4A269086
- T(n,k)=Number of nXk binary arrays with some element plus some horizontally, vertically or antidiagonally adjacent neighbor totalling two not more than once.at n=40A269089