Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109667
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109667 Beginning with 1, a(n) = n times the digits of concatenation of a(1),a(2), ...a(n-1) read backwards. +0
1
1, 2, 63, 14484, 2422068105, 30111613454906481726, 4390292266180212777245130215697390895347, 59487847503720962523422176966532983367477017476875634528888280148817939875308968 (list; graph; listen)
OFFSET

1,2

COMMENT

a(9) has 160 digits, a(10) has 320 digits. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 13 2008

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 (mathar(AT)strw.leidenuniv.nl), Feb 13 2008

CROSSREFS

Sequence in context: A067825 A091817 A024238 this_sequence A004853 A064010 A120829

Adjacent sequences: A109664 A109665 A109666 this_sequence A109668 A109669 A109670

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 03 2005

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 13 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research