32130
domain: N
Appears in sequences
- Smaller of unitary amicable pair.at n=3A002952
- Number of tree-rooted toroidal maps with 3 faces and n vertices and without isthmuses.at n=2A006437
- Coordination sequence for A_4 lattice.at n=14A008383
- Area of more than one Pythagorean triangle.at n=26A009127
- n written in fractional base 4/3.at n=20A024631
- Numbers k such that phi(k)+sigma(k) is a perfect cube.at n=22A061366
- Unitary amicable numbers.at n=6A063991
- Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/3) = 9^n, where R_n(y) forms the initial (n+1) terms of g.f. A097191(y)^(n+1).at n=13A097190
- a(n) = binomial(n+2,2)*binomial(n+5,2).at n=16A105938
- Decagonal numbers divisible by 10.at n=18A117797
- 10-gonal numbers which are divisible by the sum of their digits.at n=32A119548
- a(n) = area of Pythagorean triangle with hypotenuse p, where p = A002144(n) = n-th prime == 1 (mod 4).at n=35A145010
- Number of integer sequences of length n+1 with sum zero and sum of absolute values 28.at n=3A157063
- Numbers n such that sigma(n) = 15*phi(n) (where sigma=A000203, phi=A000010).at n=4A171260
- Sequence related to the Hankel transform of A105523(n+5).at n=33A181474
- a(n) = floor(n^(3/2))*floor(3+n^(3/2))/2.at n=39A185593
- Smallest number which is an unordered sum of two odd abundant numbers in exactly n ways.at n=25A187743
- Numbers with prime factorization pqrst^3.at n=18A189984
- 26-gonal pyramidal numbers: a(n) = n*(n+1)*(8*n-7)/2.at n=20A256646
- a(1)=2310; for n > 1, a(n) is the least integer not occurring earlier such that a(n) shares exactly five distinct prime divisors with a(n-1).at n=37A264718