24363
domain: N
Appears in sequences
- Number of n-step self-avoiding walks on a Manhattan lattice.at n=17A006744
- a(n) = floor( binomial(n,7)/7 ).at n=22A011853
- Numbers k such that sopf(k) - pi(k) = tau(k).at n=8A064445
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1.at n=19A096025
- a(n) = 1/7*( binomial(n,7) - floor(n/7) ).at n=14A215053
- Half the number of compositions of n into exactly two different parts with equal multiplicities.at n=24A242911
- Sum of digits of (2^n)!.at n=11A244060
- G.f. Sum_{n=-oo..+oo} x^n * (1 + x^n)^(n^3).at n=34A386669
- Numbers k such that sigma(k) = psi(k) + pi(k) + omega(k)^2.at n=6A390235