34163
domain: N
Appears in sequences
- 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=42A105640
- Number of primitive Pythagorean quadruples (a, b, c, d) with d < 10^n.at n=2A225207
- Number of (n+1)X(2+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal.at n=3A236792
- Number of (n+1)X(4+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal.at n=1A236794
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal.at n=11A236798
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the minimum of every 2X2 subblock equal.at n=13A236798
- Odd numbers m for which A379113(m^2) > 1, i.e., k = m^2 has a proper unitary divisor d > 1 such that A048720(A065621(sigma(d)),sigma(k/d)) is equal to sigma(k).at n=46A379122