This site is supported by donations to The OEIS Foundation.



Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000422 Concatenation of numbers from n down to 1. 41


%S 1,21,321,4321,54321,654321,7654321,87654321,987654321,10987654321,

%T 1110987654321,121110987654321,13121110987654321,1413121110987654321,

%U 151413121110987654321,16151413121110987654321,1716151413121110987654321,181716151413121110987654321

%N Concatenation of numbers from n down to 1.

%C The first prime term in this sequence is A000422(82) - _Artur Jasinski_, Mar 30 2008

%D F. Smarandache, "Properties of the Numbers", University of Craiova Archives, 1975; Arizona State University Special Collections, Tempe, AZ

%H T. D. Noe, <a href="/A000422/b000422.txt">Table of n, a(n) for n = 1..150</a>

%H R. W. Stephan, <a href="http://me.in-berlin.de/~rws/sm.pdf">Factors and primes in two Smarandache sequences</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ConsecutiveNumberSequences.html">Consecutive Number Sequences</a>

%F a(n+1) = (n+1)*10^len(a(n)) + a(n), where len(k) = number of digits in k.

%t b = {}; a = {}; Do[w = RealDigits[n]; w = First[w]; Do[PrependTo[a, w[[Length[w] - k + 1]]], {k, 1, Length[w]}]; p = FromDigits[a]; AppendTo[b, p], {n, 1, 30}]; b - _Artur Jasinski_, Mar 30 2008

%o (PARI) a(n)=my(t=n);forstep(k=n-1,1,-1,t=t*10^#Str(k)+k);t \\ _Charles R Greathouse IV_, Jul 15 2011

%Y Cf. A000422, A116504, A007908, A116505, A104759, A138789, A138790, A138793.

%K nonn,base

%O 1,2

%A R. Muller

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

Content is available under The OEIS End-User License Agreement .

Last modified April 19 19:16 EDT 2014. Contains 240777 sequences.