|
| |
|
|
A093850
|
|
Triangle T(n,r) = 10^(n-1)-1 +r*floor(9*10^(n-1)/(n+1)) read by rows, 1<=r<=n.
|
|
2
| |
|
|
4, 39, 69, 324, 549, 774, 2799, 4599, 6399, 8199, 24999, 39999, 54999, 69999, 84999, 228570, 357141, 485712, 614283, 742854, 871425, 2124999, 3249999, 4374999, 5499999, 6624999, 7749999, 8874999, 19999999, 29999999, 39999999
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| n-th row of the following triangle contains n uniformly located n-digit numbers. i.e. n terms of an arithmetic progression with 10^(n-1)-1 as the term preceding the first term and (n+1)-th term is the largest possible n-digit term.
The n-th row of this triangle can be obtained by deleting the least significant digit (9) from the (n+1)-th row of the triangle pertaining to A093846 ignoring the last term ( 10^(n+1) -1).
|
|
|
EXAMPLE
| 4
39 69
324 549 774
2799 4599 6399 8199
...
|
|
|
MAPLE
| A093850 := proc(n, r)
10^(n-1)-1+r*floor(9*10^(n-1)/(n+1)) ;
end proc:
seq(seq(A093850(n, r), r=1..n), n=1..14) ; # R. J. Mathar, Sep 28 2011
|
|
|
CROSSREFS
| Cf. A093846, A093847, A061772, A093451, A093552.
Sequence in context: A018860 A016484 A106127 * A201740 A024212 A006408
Adjacent sequences: A093847 A093848 A093849 * A093851 A093852 A093853
|
|
|
KEYWORD
| easy,nonn,tabl,uned
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 18 2004
|
| |
|
|
