Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003603
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003603 Fractal sequence obtained from Fibonacci numbers (or Wythoff array).
(Formerly M0138)
+0
8
1, 1, 1, 2, 1, 3, 2, 1, 4, 3, 2, 5, 1, 6, 4, 3, 7, 2, 8, 5, 1, 9, 6, 4, 10, 3, 11, 7, 2, 12, 8, 5, 13, 1, 14, 9, 6, 15, 4, 16, 10, 3, 17, 11, 7, 18, 2, 19, 12, 8, 20, 5, 21, 13, 1, 22, 14, 9, 23, 6, 24, 15, 4, 25, 16, 10, 26, 3, 27, 17, 11, 28, 7, 29, 18, 2, 30, 19, 12, 31, 8, 32, 20, 5, 33 (list; graph; listen)
OFFSET

1,4

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

C. Kimberling, Numeration systems and fractal sequences, Acta Arithmetica 73 (1995) 103-117.

LINKS

C. Kimberling, Fractal sequences

N. J. A. Sloane, Classic Sequences

FORMULA

Vertical para-budding sequence: says which row of Wythoff array (starting row count at 1) contains n.

If delete first occurrence of 1, 2, 3, ... the sequence is unchanged.

Contribution from Clark Kimberling (ck6(AT)evansville.edu), Oct 29 2009: (Start)

The fractal sequence of the Wythoff array can be constructed without

reference to the Wythoff array or Fibonacci numbers. Write initial rows:

Row 1: .... 1

Row 2: .... 1

Row 3: .... 1..2

Row 4: .... 1..3..2

For n>4, to form row n+1, let k be the least positive integer not yet

used; write row n, and right after the 1st number that is also in row n-1,

place k; right after the next number that is also in row n-1, place k+1,

and continue. A003603 is the concatentation of the rows. (End)

EXAMPLE

Contribution from Clark Kimberling (ck6(AT)evansville.edu), Oct 29 2009: (Start)

In the recurrence for making new rows, we get row 5 from row 4 thus:

Write row 4: 1,3,2, and then place 4 right after 1, and place 5 right

after 2, getting 1,4,3,2,5. (End)

CROSSREFS

Equals A019586(n) + 1. Cf. A003602.

Sequence in context: A167287 A007336 A133334 this_sequence A135227 A104325 A133084

Adjacent sequences: A003600 A003601 A003602 this_sequence A003604 A003605 A003606

KEYWORD

nonn,easy,nice,eigen

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 29 2003

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research