|
Search: id:A085938
|
|
|
| A085938 |
|
a(n) is the (n+1)-digit number in which the first digit is 1, and the subsequent digits increase by steps of n (mod 10). |
|
+0
2
|
|
| 12, 135, 1470, 15937, 161616, 1739517, 18529630, 197531975, 1098765432, 11111111111, 123456789012, 1357913579135, 14703692581470, 159371593715937, 1616161616161616, 17395173951739517, 185296307418529630
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
EXAMPLE
|
a(4) = 15937, 5 = 1+4, 9 = 5+4, 9+4 = 13 gives the next digit 3, 3+4 = 7 is the least significant digit.
|
|
PROGRAM
|
(PARI) a(n) = sum(i = 0, n, (1 + i*n)%10*10^(n - i)) (Wasserman)
|
|
CROSSREFS
|
Sequence in context: A016123 A015457 A015469 this_sequence A030023 A000467 A059517
Adjacent sequences: A085935 A085936 A085937 this_sequence A085939 A085940 A085941
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jason Earls and Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 14 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 14 2005
|
|
|
Search completed in 0.002 seconds
|
