38476

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=17A049904
• Number of digits in n^{(n-1)!}.at n=8A067084
• Number of arrangements of 3 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero.at n=33A190072
• Number of simple skew-merged permutations with n elements.at n=11A220589
• Numbers k such that (sigma(k) - k)^(sigma(k) - k) == k (mod sigma(k)), where sigma = A000203.at n=26A375790