28997
domain: N
Appears in sequences
- Spiral sieve using Fibonacci numbers.at n=21A005621
- Hankel transform of Moebius function A008683.at n=18A056227
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.at n=41A105640
- Number of length n+2 0..2 arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=7A251929
- T(n,k)=Number of length n+2 0..k arrays with the sum of the maximum minus the median of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=43A251935
- Expansion of Product_{k>=1} 1/(1-x^(k^2))^(k^2).at n=39A291655
- Number of joining pairs of integer partitions of n.at n=28A318915