64593
domain: N
Appears in sequences
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).at n=35A060732
- Number of (w,x,y,z) with all terms in {0,...,n} and w=max{w,x,y,z}-2*min{w,x,y,z}.at n=33A212745
- a(0) = 0, and for n > 0, (a(n)) gives the indices n for which d(n) < d(k) for k < n, where d is the difference sequence of (cos k + sin k).at n=24A299640
- Number of nX4 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A317607
- Number of nX7 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=3A317610
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=48A317611
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=51A317611
- Triangle read by rows: T(n,k) = number of collections of up to k subsets of [n] covering [n], with [0]={}; n>=0, k=0..2^n.at n=34A381683