23328
domain: N
Appears in sequences
- Number of invertible 2 X 2 matrices mod n.at n=17A000252
- Numbers n such that n / product of digits of n is a square.at n=20A001104
- Denominator of sum of -6th powers of divisors of n.at n=5A017676
- Denominator of sum of -7th powers of divisors of n.at n=5A017678
- Numbers n such that n is a substring of its square in base 6 (written in base 10).at n=40A018830
- Numbers of form 2^i*9^j, with i, j >= 0.at n=43A025611
- Numbers of form 3^i*6^j, with i, j >= 0.at n=33A025614
- Ratios of successive terms are 3, 2, 3, 2, 3, 2, 3, 2, ...at n=11A026532
- a(n) = 6*a(n-2), starting with 1, 3, 9.at n=11A026565
- Number of primitive polynomials of degree n over GF(8).at n=6A027744
- a(n) = 4*n^3.at n=18A033430
- a(n) = ceiling((n^3)/2).at n=36A036486
- a(n) = floor((n^3)/2).at n=36A036487
- 4-full numbers: if a prime p divides k then so does p^4.at n=35A036967
- Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*9^j.at n=13A038287
- Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*8^j.at n=11A038298
- Obtainable by applying +, * and exponentiation to its own digits.at n=31A046469
- Octahedral torus number: a(n) = n^2 + 2*(Sum_{k=1..n-1} k^2) - 2*(floor((n+1)/2)^2 + 2*(Sum_{k=1..floor((n+1)/2)-1} k^2)) + (1 - (-1)^n)/2.at n=35A050442
- If n = Product p_i^e_i then p_i < e_i (where e_i > 0) for all i.at n=33A054743
- a(n) = floor(n^n/2).at n=6A057065