18897

Appears in sequences

• a(n) = Sum_{i=0..n} digsum_5(i)^4, where digsum_5(i) = A053824(i).at n=33A231671
• O.g.f.: exp( Integral Sum_{n>=1} n! * n^(n-1) * x^(n-1) / Product_{k=1..n} (1 - k*x) dx ).at n=5A243440
• Number of length n+7 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=36A255998
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 525", based on the 5-celled von Neumann neighborhood.at n=26A272740
• Number of permutations of [n] avoiding {4312, 1432, 1234}.at n=10A294766
• Number of nX5 0..1 arrays with every element unequal to 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A316798
• Number of nX7 0..1 arrays with every element unequal to 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=4A316800
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=59A316801
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=61A316801
• Numbers k such that both k and k+2 are de Polignac numbers (A006285).at n=29A330284
• Number of non-Look-and-Say partitions of n. Number of integer partitions of n such that there is no way to choose a disjoint strict integer partition of each multiplicity.at n=37A351293