76305
domain: N
Appears in sequences
- a(n) = integer nearest a(n-1)/(sqrt(7) - 2), where a(1) = 1.at n=25A024567
- a(n) = Sum_{k=m..n} T(k,n-k), where m = floor((n+1)/2); a(n) is the n-th diagonal-sum of left justified array T given by A027948.at n=28A027959
- Triangle T(n,k) read by rows: number of permutations in [n] with exactly k ascents that have an even number of inversions.at n=57A128612
- Triangle T(n,k) read by rows: number of permutations in [n] with exactly k ascents that have an odd number of inversions.at n=63A128613
- Triangle read by rows: T(n,k) is the number of odd permutations of {1,2,...,n} having k descents. (n>=1, k>=1).at n=43A145883
- 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, 0), (-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 0, -1)}.at n=10A148932
- Numbers k such that sum_{i=1..k} d(i)^2 is a square c^2, where d(i) is the number of divisors of i.at n=24A186429