50796
domain: N
Appears in sequences
- Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, in alternating directions. The first entry is 1 each time. For the next element of a diagonal, add to the previous element the elements of the row and the column the new element is in. The final element of each diagonal gives a(n).at n=7A059513
- The array described in A059513 read by antidiagonals in the 'up' direction.at n=35A059574
- The array described in A059513 read by antidiagonals in the direction of construction.at n=35A059575
- Sum of largest parts (counted with multiplicity) of all partitions of n.at n=29A092321
- a(n) = smallest k such that prime(n) is the n-th largest divisor of k.at n=22A226326
- Number T(n,k) of derangements of [n] having exactly k peaks; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/2)), read by rows.at n=24A303564