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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069172 Smallest triangular number such that arithmetic mean of its digits = n (sum of the digits = n times the number of digits). 0
1, 105, 3, 435, 28, 6, 5995, 589598998999878 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(9) > 10^100000 if it exists. a(9) must be of the form 10^x-1. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Mar 30 2010]

MATHEMATICA

Do[k = 1; While[ Apply[ Plus, IntegerDigits[k(k + 1)/2]] != n*Floor[ Log[10, k(k + 1)/2] + 1], k++ ]; Print[k(k + 1)/2], {n, 1, 7}]

CROSSREFS

Cf. A069790.

Sequence in context: A048920 A091539 A157874 * A104437 A112814 A058179

Adjacent sequences:  A069169 A069170 A069171 * A069173 A069174 A069175

KEYWORD

base,fini,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 09 2002

EXTENSIONS

a(8) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Mar 30 2010

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:17 EST 2012. Contains 205623 sequences.