44499
domain: N
Appears in sequences
- Numerators of continued fraction convergents to sqrt(366).at n=8A041692
- From Renyi's "beta expansion of 1 in base 3/2": sequence gives a(1), a(2), ... where x(n) = a(n)/2^n, with 0 < a(n) < 2^n, a(1) = 1, a(n) = 3*a(n-1) modulo 2^n.at n=15A058842
- 4-almost primes with semiprime digits (digits 4, 6, 9 only).at n=22A111496
- Triangle read by rows: T(n,k) is the number of permutations of [n] having no 3-sequences and having k successions (0 <= k <= floor(n/2)); a succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=27A180185
- Numbers n such that (n^6 + 1091)/4 is prime.at n=20A181112
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k blocks of length 2 (0 <= k <= floor(n/2)). A block of a permutation is a maximal sequence of consecutive integers which appear in consecutive positions. For example, the permutation 5412367 has 4 blocks: 5, 4, 123, and 67; one of them is of length 2.at n=47A184183
- Number of vertices in truncated tetrahedron with faces that are centered polygons.at n=19A193218
- Numbers with digits 4 and 9 only.at n=33A284973
- Triangle read by rows: T(n-1,k), where n >= 2 and 1 <= k <= floor(n/2), is the number of permutations of (1, 2, ..., n) having k consecutive pairs but no consecutive sequences of length greater than 2.at n=17A289632
- Triangle read by rows: T(n-1,k), where n >= 2 and 1 <= k <= floor(n/2), is the number of permutations of (1, 2, ..., n) having k consecutive pairs but no consecutive sequences of length greater than 2.at n=34A289632
- a(n) = 87*2^n - 45.at n=9A304613
- Number of vertices in a regular drawing of the complete bipartite graph K_{n,n}.at n=24A331755
- a(n) = (1/(n+1)) * Sum_{k=0..n} (k+1)^5 * binomial(2*n-k,n-k).at n=6A390964