609960
domain: N
Appears in sequences
- Solution to a Diophantine equation: each term is a triangular number and each term + 1 is a square.at n=8A006454
- Triangular numbers using only the curved digits 0, 3, 6, 8 and 9.at n=23A079653
- Triangular numbers composed of digits {0,6,9}.at n=7A119091
- Triangular numbers that are sums of twin prime pairs.at n=30A165966
- Triangular numbers that differ from a square by 1.at n=13A182334
- Sequences A124174 and A006454 interlaced.at n=17A217278
- Triangular numbers representable as t*p, where t>1 is a triangular number, p>1 is a prime power (A025475).at n=7A221563
- Number of ways of writing n as the sum of 10 triangular numbers from A000217.at n=34A226254
- Triangular numbers representable as x*y+x+y such that x and y are triangular numbers, x>=y>1.at n=39A259746
- Triangular numbers that are eight times another triangular number.at n=4A336626