23778
domain: N
Appears in sequences
- Related to enumeration of branched orientable surface coverings over a non-orientable surface.at n=2A112615
- Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=37A127022
- Number of partitions of n containing at least one part m-5 if m is the largest part.at n=39A212545
- T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=46A248987
- Number of length 2+4 0..n arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=8A248989
- Number of ways to transform a sequence of n ones and n twos to a single number by continually removing two numbers and replacing them with their sum modulo 3.at n=5A276029
- Indices of records in A360519.at n=52A361108
- Numbers that can be written in exactly three different ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t} for some t > 0.at n=1A386967