login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062688 Smallest triangular number with digit sum n (or 0 if no such number exists). 1
1, 0, 3, 0, 0, 6, 0, 0, 36, 28, 0, 66, 0, 0, 78, 0, 0, 378, 496, 0, 1596, 0, 0, 8385, 0, 0, 5778, 5995, 0, 8778, 0, 0, 47895, 0, 0, 67896, 58996, 0, 196878, 0, 0, 468996, 0, 0, 887778, 1788886, 0, 4896885, 0, 0, 5897895, 0, 0, 13999986, 15997996, 0, 38997696 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..57.

EXAMPLE

66 is the smallest triangular number with digit sum 12

CROSSREFS

Sequence in context: A194498 A193986 * A067181 A145225 A061480 A220692

Adjacent sequences:  A062685 A062686 A062687 * A062689 A062690 A062691

KEYWORD

base,easy,nonn

AUTHOR

Erich Friedman, Jul 04 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 03:15 EDT 2018. Contains 316275 sequences. (Running on oeis4.)