Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A163256
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A163256 Fractal sequence of the interspersion A163253. +0
5
1, 2, 3, 1, 2, 4, 3, 5, 1, 2, 4, 6, 3, 5, 7, 1, 2, 4, 6, 8, 3, 5, 7, 9, 1, 2, 4, 6, 8, 10, 3, 5, 7, 9, 11, 1, 2, 4, 6, 8, 10, 12, 3, 5, 7, 9, 11, 13, 1, 2, 4, 6, 8, 10, 12, 14, 3, 5, 7, 9, 11, 13, 15, 1, 2, 4, 6, 8, 10, 12, 14, 16, 3, 5, 7, 9, 11, 13, 15, 17, 1, 2, 4, 6, 8, 10, 12, 14, 16, 18, 3, 5, 7 (list; graph; listen)
OFFSET

1,2

COMMENT

As a fractal sequence, A163256 contains every positive integer;

indeed, A163256 properly contains itself (infinitely many times).

REFERENCES

Clark Kimberling, "Doubly interspersed sequences, double interspersions, and fractal sequences," preprint, 2009.

EXAMPLE

Append the following segments:

1 2 3

1 2 4 3 5

1 2 4 6 3 5 7

1 2 4 6 8 3 5 7 9

For n>1, the nth segment arises from the (n-1)st by

inserting 2*n at position n+1 and appending 2*n+1 at

position 2*n+1.

CROSSREFS

A163253, A163254, A163255, A163257, A163258.

Sequence in context: A029271 A035459 A048232 this_sequence A144962 A166871 A152736

Adjacent sequences: A163253 A163254 A163255 this_sequence A163257 A163258 A163259

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Jul 24 2009

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research