login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245325 Numerators of an enumeration system of the reduced nonnegative rational numbers 12
1, 1, 2, 2, 1, 3, 3, 3, 3, 2, 1, 5, 4, 5, 4, 5, 4, 5, 4, 3, 3, 2, 1, 8, 7, 7, 5, 8, 7, 7, 5, 8, 7, 7, 5, 8, 7, 7, 5, 5, 4, 5, 4, 3, 3, 2, 1, 13, 11, 12, 9, 11, 10, 9, 6, 13, 11, 12, 9, 11, 10, 9, 6, 13, 11, 12, 9, 11, 10, 9, 6, 13, 11, 12, 9, 11, 10, 9, 6, 8, 7, 7, 5, 8, 7, 7, 5, 5, 4, 5, 4, 3, 3, 2, 1, 21, 18, 19, 14, 19 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n)/A245326(n) enumerates all the reduced nonnegative rational numbers exactly once.

If the terms (n>0) are written as an array (left-aligned fashion) with rows of length 2^m, m = 0,1,2,3,...

1,

1,2,

2,1,3,3,

3,3,2,1,5,4,5,4,

5,4,5,4,3,3,2,1,8,7,7,5,8,7,7,5,

8,7,7,5,8,7,7,5,5,4,5,4,3,3,2,1,13,11,12,9,11,10,9,6,13,11,12,9,11,10,9,6,

then the sum of the m-th row is 3^m (m = 0,1,2,), each column k is a Fibonacci sequence.

If the rows are written in a right-aligned fashion:

                                                                        1,

                                                                      1,2,

                                                                 2, 1,3,3,

                                                      3, 3, 2,1, 5, 4,5,4,

                                 5, 4, 5,4, 3, 3,2,1, 8, 7, 7,5, 8, 7,7,5,

8,7,7,5,8,7,7,5,5,4,5,4,3,3,2,1,13,11,12,9,11,10,9,6,13,11,12,9,11,10,9,6,

then each column is an arithmetic sequence. The differences of the arithmetic sequences gives the sequence A071585 (a(2^(m+1)-1-k) - a(2^m-1-k) = A071585(k), m = 0,1,2,..., k = 0,1,2,...,2^m-1).

If the sequence is considered by blocks of length 2^m, m = 0,1,2,..., the blocks of this sequence are permutations of terms of blocks from A002487 (Stern's diatomic series or Stern-Brocot sequence), and, more precisely, the reverses of blocks of A229742 ( a(2^m+k) = A229742(2^(m+1)-1-k), m = 0,1,2,..., k = 0,1,2,...,2^m-1). Moreover, each block is the bit-reversed permutation of the corresponding block of A245327.

LINKS

Table of n, a(n) for n=1..100.

Index entries for fraction trees

PROG

(R)

blocklevel <- 6 # arbitrary

a <- 1

for(m in 0:blocklevel) for(k in 0:(2^(m-1)-1)){

  a[2^(m+1)+k]             <- a[2^m+2^(m-1)+k]

  a[2^(m+1)+2^(m-1)+k]     <- a[2^m+k]

  a[2^(m+1)+2^m+k]         <- a[2^(m+1)+k] +  a[2^m+k]

  a[2^(m+1)+2^m+2^(m-1)+k] <- a[2^(m+1)+2^m+k]

}

a

CROSSREFS

Cf. A245326, A002487, A071585, A229742, A273494.

Sequence in context: A164999 A292030 A162909 * A091224 A308684 A112182

Adjacent sequences:  A245322 A245323 A245324 * A245326 A245327 A245328

KEYWORD

nonn,frac

AUTHOR

Yosu Yurramendi, Jul 18 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 09:37 EDT 2020. Contains 334620 sequences. (Running on oeis4.)