21652

Appears in sequences

• From expansion of falling factorials.at n=12A005492
• Number of intransitive (or alternating, or Stanley) trees: vertices are [0,n] and for no i<j<k are both (i,j) and (j,k) edges.at n=7A007889
• Number of partitions satisfying cn(0,5) + cn(2,5) < cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=39A039885
• Solution to the Dancing School Problem with 6 girls and n+6 boys: f(6,n).at n=6A079911
• Solution to the Dancing School Problem with n girls and n+6 boys: f(n,6).at n=5A079925
• a(n) = A026905(n) - A014284(n).at n=28A086741
• Convolution square of A000219.at n=12A161870
• T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 1 time.at n=60A248944
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 389", based on the 5-celled von Neumann neighborhood.at n=31A271596
• a(n) = unreduced numerator in Sum_{k=1..n} (-1)^(k-1)/k^k.at n=4A279020
• Numbers that are the sum of eight fourth powers in nine or more ways.at n=29A345584
• Numbers that are the sum of eight fourth powers in exactly nine ways.at n=14A345841
• Largest even k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists.at n=8A357573
• Consecutive states of the linear congruential pseudo-random number generator for Smalltalk-80 when started at 1.at n=35A384220