41749

Appears in sequences

• 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 the search for an element exchangeable with a_j has to be started.at n=6A079752
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,1,2}.at n=45A079982
• The q-exponential of x, e_q(x,q), evaluated at q = -x.at n=23A152398
• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=1 and l=-1.at n=12A176759
• Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 0,-1 -2,0 or 1,1.at n=13A264879
• Bases b where exactly eight primes p with p < b exist such that p is a base-b Wieferich prime.at n=18A325884
• Numbers k such that A360331(k) = A360331(k+1).at n=16A360359