Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125152
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125152 The interspersion T(3,2,0), by antidiagonals. +0
3
1, 3, 2, 9, 6, 4, 27, 20, 13, 5, 81, 60, 40, 15, 7, 243, 182, 121, 45, 22, 8, 729, 546, 364, 136, 68, 25, 10, 2187, 1640, 1093, 410, 205, 76, 30, 11, 6561, 4920, 3280, 1230, 615, 230, 91, 34, 12, 19683, 14762, 9841, 3690, 1845, 691, 273, 102, 38, 14 (list; table; graph; listen)
OFFSET

1,2

COMMENT

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

REFERENCES

C. Kimberling, "Interspersions and fractal sequences associated with fractions (c^j)/(d^k)," preprint, 2006.

LINKS

C. Kimberling, Interspersions and Dispersions.

FORMULA

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].

EXAMPLE

Northwest corner:

1 3 9 27 81 243 729

2 6 20 60 182 546 1640

4 13 40 121 364 1093 3280

5 15 45 136 410 1230 3690

7 22 68 205 615 1845 5535

CROSSREFS

Cf. A125156, A125160.

Sequence in context: A033313 A140590 A164279 this_sequence A082819 A078478 A019778

Adjacent sequences: A125149 A125150 A125151 this_sequence A125153 A125154 A125155

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Nov 21 2006, corrected Nov 24 2006

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research