28092

Appears in sequences

• Number of lines through exactly 4 points of an n X n grid of points.at n=43A018811
• Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.1'.at n=6A079754
• Non-palindromic numbers n such that phi(n) = phi(reversal(n)).at n=20A097647
• Triangle read by rows: row n (n>=0) has g.f. Sum_{i=1..n} n!*x^i*(1+x)^(n-i)/(n+1-i).at n=32A126671
• 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, 1), (-1, 1, -1), (1, -1, -1), (1, 0, 0)}.at n=12A148012
• 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, 1, -1), (1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=8A150413
• Number of partitions of (2, n) into a sum of distinct pairs.at n=38A268345
• The sum of the necessary diagonal movements from each square unit of an n X n+1 rectangle to reach any of the corners of the rectangle.at n=36A279034
• Expansion of Product_{k>=1} ((1 + x^(k^2)) / (1 - x^(k^2)))^k.at n=45A291667
• List of numbers n such that A039654(n) reaches a new record high.at n=29A292113
• Indices k of highly composite numbers with records of low values of the ratio between consecutive terms, A002182(k+1)/A002182(k).at n=18A309745