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!)
A125150 The interspersion T(2,3,0), by antidiagonals. 2

%I #6 Mar 30 2012 18:57:06

%S 1,2,3,4,7,5,8,14,10,6,16,28,21,12,9,32,56,42,25,18,11,64,113,85,50,

%T 37,22,13,128,227,170,101,75,44,26,15,256,455,341,202,151,89,53,31,17,

%U 512,910,682,404,303,179,106,63,35,19,1024,1820,1365,809,606,359,213,126

%N The interspersion T(2,3,0), by antidiagonals.

%C Every positive integer occurs exactly once and each pair of rows are interspersed after initial terms.

%D Clark Kimberling, Interspersions and fractal sequences associated with fractions (c^j)/(d^k), Journal of Integer Sequences 10 (2007, Article 07.5.1) 1-8.

%H C. Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/intersp.html">Interspersions and Dispersions</a>.

%F Row 1: t(1,h)=2^(h-1), h=1,2,3,... Row 2: t(2,h)=Floor[r*2^(h-1)], r=(2^5)/(3^2), where 3=Floor[r] is least positive integer (LPI) not in row 1. Row 3: t(3,h)=Floor[r*2^(h-1)], r=(2^4)/(3^1), where 5=Floor[r] is the LPI not in rows 1 and 2. Row m: t(m,h)=Floor[r*2^(h-1)], where r=(2^j)/(3^k), where k is the LPI for which there is an integer j for which the LPI not in rows 1,2,...,m-1 is Floor[r].

%e Northwest corner:

%e 1 2 4 8 16 32 64

%e 3 7 14 28 56 113 227

%e 5 10 21 42 85 170 341

%e 6 12 25 50 101 202 404

%e 9 18 37 75 151 303 606

%Y Cf. A125154, A125158.

%K nonn,tabl

%O 1,2

%A _Clark Kimberling_, Nov 21 2006

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 April 25 08:20 EDT 2024. Contains 371964 sequences. (Running on oeis4.)