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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093846 Triangle read by rows: for 1 <= k <= n, a(n, k) = 10^(n-1)-1+k*floor(9*10^(n-1)/n). 6
9, 54, 99, 399, 699, 999, 3249, 5499, 7749, 9999, 27999, 45999, 63999, 81999, 99999, 249999, 399999, 549999, 699999, 849999, 999999, 2285713, 3571427, 4857141, 6142855, 7428569, 8714283, 9999997, 21249999, 32499999, 43749999, 54999999 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

10^(n-1)-1 and the n-th row are n+1 numbers in arithmetic progression and the common difference is the largest such that a(n, n) has n digits. This common difference equals A061772(n).

MAPLE

A093846 := proc(n, k) RETURN (10^(n-1)-1+k*floor(9*(10^(n-1)/n))); end; for n from 1 to 10 do for k from 1 to n do printf("%d, ", A093846(n, k)); od; od; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 23 2006

CROSSREFS

Cf. A061772, A093847, A093849, A093850.

Sequence in context: A001688 A144040 A052108 * A152994 A034719 A013567

Adjacent sequences:  A093843 A093844 A093845 * A093847 A093848 A093849

KEYWORD

base,easy,less,nonn,tabl

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 18 2004

EXTENSIONS

Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 23 2006

Edited by David Wasserman (dwasserm(AT)earthlink.net), Mar 26 2007

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 08:32 EST 2012. Contains 205614 sequences.