63393

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=17A049894
• Expansion of e.g.f. exp(x + x^2 + x^3).at n=8A118589
• Number of 5-element nondividing subsets of {1, 2, ..., n}.at n=32A187492
• Triangle read by rows: T(n,k) is the number of nilpotent subpermutations on an n-set, each of nilpotency index less than or equal to k.at n=39A261764
• Square array A(n,k), n >= 0, k >= 1, read by antidiagonals downwards, where column k is the expansion of e.g.f. exp(Sum_{j=1..k} x^j).at n=63A293669
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(Product_{j=1..n} (1+x^j) - 1).at n=63A294250
• Odd composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 3 (mod m), where U(m) and V(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=3 and b=-1, respectively.at n=36A337626