300700
domain: N
Appears in sequences
- Smallest triangular number containing exactly n 0's.at n=3A036517
- Triangular numbers that can be written as sum of two positive cubes.at n=10A113958
- Triangular numbers composed of digits {0,3,7}.at n=4A119065
- Triangular numbers t such that all the digits needed to write the consecutive triangular numbers from 0 to t fill exactly an equilateral triangle (no holes, no overlaps).at n=34A158030
- Triangular numbers divisible by the square of the sum of their digits.at n=15A243008
- a(n) = 4*p(n), where p(n) is the number of partitions of n.at n=44A299474