847288609443
domain: N
Appears in sequences
- Powers of 3: a(n) = 3^n.at n=25A000244
- 25th powers: a(n) = n^25.at n=3A010813
- a(n) = 3^(2*n+1).at n=12A013708
- a(n) = 3^(3*n + 1).at n=8A013732
- a(n) = 3^(4*n + 1).at n=6A013778
- a(n) = (12*n + 3)^5.at n=20A017561
- a(n) = Sum_{k=0..2n} (k+1) * A026323(n, 2n-k).at n=24A027313
- a(n) = 3^n*n^(n-1).at n=8A038061
- Earliest sequence where a(a(n))=3^n.at n=25A038756
- If m = p_i^e_i, n=Product p_j^f_j, set G_m(n) = Product p_{j+i}^{f_j*e_i}; extend G_m to all m by multiplicativity; sequence gives a(n)=G_n(n).at n=31A045974
- Order of Burnside group B(3,n) of exponent 3 and rank n.at n=5A051576
- Expansion of g.f. (2-3*x-x^2)/((1-x^2)*(1-3*x)).at n=25A052929
- Powers of 3 which are not powers of 3^3.at n=16A055156
- a(n) = 3^(n^2).at n=5A060722
- Floor[ Sum_{1..n} 1/i ]^n.at n=24A067053
- Powers of 3 with strictly increasing sum of digits.at n=7A069028
- Number of strings over Z_3 of length n with trace 0 and subtrace 0.at n=26A073947
- Number of strings over Z_3 of length n with trace 1 and subtrace 0.at n=26A073950
- Number of strings over Z_3 of length n with trace 1 and subtrace 1.at n=26A073951
- Number of strings over Z_3 of length n with trace 1 and subtrace 2.at n=26A073952