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

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

%S 1,3,2,9,6,4,27,20,13,5,81,60,40,15,7,243,182,121,45,22,8,729,546,364,

%T 136,68,25,10,2187,1640,1093,410,205,76,30,11,6561,4920,3280,1230,615,

%U 230,91,34,12,19683,14762,9841,3690,1845,691,273,102,38,14

%N The interspersion T(3,2,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)=Floor[r*3^(h-1)], where r=(3^0)/(2^0), h=1,2,3,... Row 2: t(2,h)=Floor[r*3^(h-1)], r=(3^2)/(2^2), where 2=Floor[r] is least positive integer (LPI) not in row 1. Row 3: t(3,h)=Floor[r*3^(h-1)], r=(3^2)/(2^1), where 4=Floor[r] is the LPI not in rows 1 and 2. Row m: t(m,h)=Floor[r*3^(h-1)], where r=(3^j)/(2^k), where k is the least integer >=0 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 3 9 27 81 243 729

%e 2 6 20 60 182 546 1640

%e 4 13 40 121 364 1093 3280

%e 5 15 45 136 410 1230 3690

%e 7 22 68 205 615 1845 5535

%Y Cf. A125156, A125160.

%K nonn,tabl

%O 1,2

%A _Clark Kimberling_, Nov 21 2006, corrected Nov 24 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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)