|
|
A068129
|
|
Triangular numbers with sum of digits = 10.
|
|
5
|
|
|
28, 55, 91, 136, 190, 253, 325, 406, 703, 820, 1081, 1225, 1540, 1711, 2080, 2701, 3160, 3403, 5050, 7021, 10153, 11026, 12403, 15400, 17020, 20503, 21115, 23005, 24310, 32131, 41041, 51040, 52003, 60031, 72010, 80200, 90100, 106030, 110215
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
1. The sequence is unbounded, as the (2*10^k +2)-th triangular number is a term. 2. The sum of the digits of triangular numbers in most cases is a triangular number. 3. Conjecture: For every triangular number T there exist infinitely many triangular numbers with sum of digits = T.
The second assertion above is wrong. Out of the first 100,000 triangular numbers, only 26,046 have a sum of their digits equal to a triangular number. - Harvey P. Dale, Jun 07 2017
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[Accumulate[Range[1000]], Total[IntegerDigits[#]]==10&] (* Harvey P. Dale, Jun 07 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|