The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109667 Beginning with 1, a(n) = n times the digits of concatenation of a(1),a(2), ...a(n-1) read backwards. 1
1, 2, 63, 14484, 2422068105, 30111613454906481726, 4390292266180212777245130215697390895347, 59487847503720962523422176966532983367477017476875634528888280148817939875308968 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(9) has 160 digits, a(10) has 320 digits. - R. J. Mathar, Feb 13 2008
LINKS
EXAMPLE
a(2) = 2*1 = 2, a(3) = 3*21 = 63, a(4) = 4*3621 = 14484.
MAPLE
A109667 := proc(n) option remember ; if n = 1 then 1; else digs := [] ; for i from 1 to n-1 do digs := [op(digs), op(ListTools[Reverse](convert(A109667(i), base, 10))) ] ; od: n*add(op(i, digs)*10^(i-1), i=1..nops(digs)) : fi ; end: seq(A109667(n), n=1..9) ; # R. J. Mathar, Feb 13 2008
CROSSREFS
Sequence in context: A239744 A024238 A234279 * A330059 A004853 A249073
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Aug 03 2005
EXTENSIONS
More terms from R. J. Mathar, Feb 13 2008
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 10:07 EDT 2024. Contains 372532 sequences. (Running on oeis4.)