Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125151
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125151 The interspersion T(2,3,1), by antidiagonals. +0
3
1, 2, 3, 5, 7, 4, 10, 14, 9, 6, 21, 28, 18, 12, 8, 42, 56, 37, 25, 16, 11, 85, 113, 75, 50, 33, 22, 13, 170, 227, 151, 101, 67, 44, 26, 15, 341, 455, 303, 202, 134, 89, 53, 31, 17, 682, 910, 606, 404, 269, 179, 106, 63, 35, 19, 1365, 1820, 1213, 809, 539, 359, 213, 126 (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*2^(h-1)], where r=(2^2)/(3^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^7)/(3^3), where 4=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 least integer >=1 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 2 5 10 21 42 85

3 7 14 28 56 113 227

4 9 18 37 75 151 303

6 12 25 50 101 202 404

8 16 33 67 134 269 539

CROSSREFS

Cf. A125155, A125159.

Sequence in context: A065037 A101438 A103683 this_sequence A103866 A080164 A126048

Adjacent sequences: A125148 A125149 A125150 this_sequence A125152 A125153 A125154

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Nov 21 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research