The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127320 Start with i=1 and j=2. Concatenate i and j, get k = floor ij/j, concatenate j and k, etc. 0

%I

%S 1,2,6,4,16,26,62,42,148,284,522,545,958,569,1684,3379,4984,6780,7352,

%T 9222,7973,11567,68929,16782,410732,40859,1005243,406459,2473172,

%U 1643473,15048450,10921212,137791026,79259241,173848531

%N Start with i=1 and j=2. Concatenate i and j, get k = floor ij/j, concatenate j and k, etc.

%C It is easy to see that in all such sequences a(n+2) > a(n). Therefore for any pair of initial terms, the sequence consist of two interweaving strictly increasing subsequences formed by the elements at odd and even positions. So there are no loops in such sequences.

%o (PARI) a=[1,2]; for(k=3,50,a=concat(a,[eval(concat(Str(a[k-2]),Str(a[k-1])))\a[k-1]])); a

%K nonn,base

%O 1,2

%A _Eric Angelini_, Aug 05 2007

%E More terms, PARI program and comment from Max Alekseyev, Aug 05 2007

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.

Last modified May 17 16:12 EDT 2022. Contains 353747 sequences. (Running on oeis4.)