33984

Appears in sequences

• Second-order Eulerian numbers <<n+1,n-1>>.at n=5A002538
• Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=26A008517
• Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 11 (most significant digit on right).at n=20A029504
• A unitary phi reciprocal amicable number: consider two different numbers r, s which satisfy the following equation for some integer k: uphi(r) = uphi(s) = (1/k) * r * s / (r-s); or equivalently, 1/uphi(r) = 1/uphi(s) = k * (1/s - 1/r); sequence gives s numbers.at n=15A080767
• Coefficient triangle for polynomials used for o.g.f.s for unsigned Stirling1 diagonals.at n=22A112007
• 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, 1), (-1, 0, 0), (0, -1, 0), (0, 0, 1), (1, 1, -1)}.at n=10A148456
• Number of permutations of floor(i*5/2), i=0..n-1, with all sums of 5 adjacent terms unique.at n=7A152353
• Number of permutations of floor(i*7/2), i=0..n-1, with all sums of 5 adjacent terms unique.at n=7A152357
• Number of permutations of floor(i*9/4), i=0..n-1, with all sums of 5 adjacent terms unique.at n=7A152365
• Triangle related to the o.g.f.s. of the right-hand columns of A130534 (E(x,m=1,n)).at n=29A163936
• Numbers with 42 divisors.at n=29A175750
• Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=27A179703
• Triangle of second-order Eulerian numbers T(n,k) (n>=0, 0 <= k <= n) read by rows.at n=33A201637
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=18A208376
• Triangle read by rows: row n gives coefficients of expansion of Product_{k=2..n} ((n+1-k)*x+k), starting with lowest power.at n=23A220884
• Number of tilings of a 5 X n rectangle using n pentominoes of shapes I, N, P, U, T.at n=9A247103
• Number of permutations of [n] with no carrier element, that is, having their exterior (longest pattern that is both a proper prefix and a proper suffix) contained in their interior (permutation obtained by deleting the first and the last entry) as a consecutive pattern.at n=6A263866
• Array of basis permutations, seen as a triangle read by rows: Row k (k >= 0) gives the values of b(n, k) = number of permutations of size n (2 <= n <= 2(k+1)) in the permutation basis B(k) (see Comments for further details).at n=43A265163
• Row reversed version of triangle A201637 (second-order Eulerian triangle).at n=30A288874
• Expansion of e.g.f. -log(1 - x)*arcsinh(x).at n=9A302610